Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Compactness and finite forcibility of graphons

Tools
- Tools
+ Tools

Glebov, Roman, Králʼ, Daniel and Volec, Jan (2019) Compactness and finite forcibility of graphons. Journal of the European Mathematical Society, 21 (10). pp. 3199-3223. doi:10.4171/JEMS/901 ISSN 1435-9855.

[img]
Preview
PDF
WRAP-Compactness-finite-forcibility-graphons-Kral-2019.pdf - Accepted Version - Requires a PDF viewer.

Download (609Kb) | Preview
Official URL: https://doi.org/10.4171/JEMS/901

Request Changes to record.

Abstract

Graphons are analytic objects associated with convergent sequences of graphs. Problems from extremal combinatorics and theoretical computer science led to a study of graphons determined by finitely many subgraph densities, which are referred to as finitely forcible. Following the intuition that such graphons should have finitary structure, Lovasz and Szegedy conjectured that the topological space of typical vertices of a finitely forcible graphon is always compact. We disprove the conjecture by constructing a finitely forcible graphon such that the associated space is not compact. The construction method gives a general framework for constructing finitely forcible graphons with non-trivial properties.

Item Type: Journal Article
Subjects: Q Science > QA Mathematics > QA75 (Please use QA76 Electronic Computers. Computer Science)
Divisions: Faculty of Science, Engineering and Medicine > Science > Mathematics
Library of Congress Subject Headings (LCSH): Combinatorial analysis, Graph theory
Journal or Publication Title: Journal of the European Mathematical Society
Publisher: European Mathematical Society Publishing House
ISSN: 1435-9855
Official Date: 24 June 2019
Dates:
DateEvent
24 June 2019Published
10 April 2019Accepted
Volume: 21
Number: 10
Page Range: pp. 3199-3223
DOI: 10.4171/JEMS/901
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Copyright Holders: © 2019. European Mathematical Society
Date of first compliant deposit: 29 April 2019
Date of first compliant Open Access: 30 April 2019
RIOXX Funder/Project Grant:
Project/Grant IDRIOXX Funder NameFunder ID
259385Seventh Framework Programmehttp://dx.doi.org/10.13039/100011102
648509H2020 European Research Councilhttp://dx.doi.org/10.13039/100010663
EP/M025365/1[EPSRC] Engineering and Physical Sciences Research Councilhttp://dx.doi.org/10.13039/501100000266
800607 H2020 European Research Councilhttp://dx.doi.org/10.13039/100010663
Related URLs:
  • https://www.ems-ph.org/journals/journal....
Open Access Version:
  • ArXiv

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us