On a question of Vera T. Sós about size forcing of graphons

DOI10.1007/s10474-022-01265-8OpenAlexW4309879554MaRDI QIDQ2678384

Oleg Pikhurko, Mihyun Kang, Oliver Cooley

Publication date: 23 January 2023

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.09114

zbMATH Keywords

graphon\(k\)-samplegraph containergraphon forcing

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (05C99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypergraph containers
• Testing properties of graphs and functions
• The large deviation principle for the Erdős-Rényi random graph
• Limits of dense graph sequences
• Szemerédi's lemma for the analyst
• Representations for partially exchangeable arrays of random variables
• On the number of graphs without 4-cycles
• Independent sets, cliques, and colorings in graphons
• Finitely forcible graphons
• Moments of two-variable functions and the uniqueness of graph limits
• Generalized quasirandom graphs
• Graph limits and exchangeable random graphs
• The Asymptotic Number of Lattices
• On the number of independent sets in expanders
• Independent sets in hypergraphs
• Komlós's tiling theorem via graphon covers
• Real Analysis
• Quasi-random graphs
• On the graph limit question of Vera T. Sós