On the graph limit question of Vera T. Sós

DOI10.1016/J.JCTB.2015.09.003MaRDI QIDQ5899550zbMATH OpenOpenAlexFDO

Authors Endre Csóka

Publication date 11 December 2015

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

graph homomorphismsgraph limitsquasi-random graphs

Mathematics Subject Classification ID

Density (toughness, etc.) (05C42) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Random graphs (graph-theoretic aspects) (05C80)

Abstract: In the dense graph limit theory, the topology of the set of graphs is defined by the distribution of the subgraphs spanned by finite number of random vertices. Vera T. S'os proposed a question that if we consider only the number of edges in the spanned subgraphs, then whether it provides an equivalent definition. We show that the answer is positive on quasirandom graphs, and we prove a generalization of the statement.

Recommendations

• On the graph limit question of Vera T. Sós
• On a question of Vera T. Sós about size forcing of graphons
• Graph limits: An alternative approach to s‐graphons
• On limits of finite graphs
• scientific article; zbMATH DE number 922268
• scientific article; zbMATH DE number 5044305
• scientific article; zbMATH DE number 3946162
• scientific article; zbMATH DE number 1869733
• On limit graphs of finite vertex-primitive graphs
• Limit theory for the Gilbert graph

Cites work

• Large networks and graph limits
• Limits of dense graph sequences
• Quasi-random graphs

Cited in

(3)

• On a question of Vera T. Sós about size forcing of graphons
• On the graph limit question of Vera T. Sós
• Some exact inducibility-type results for graphs via flag algebras

This page was built for publication: On the graph limit question of Vera T. Sós

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899550)