Finitely forcible graphons with an almost arbitrary structure
Discrete Analysis · 2020
DOI: 10.19086/da.12058 ↗At a glance
Journal article in Discrete Analysis, 2020. Written by Jonathan Noel and 3 co-authors.
Abstract (original language)
A basic result from the theory of quasirandom graphs, due to Andrew Thomason, is that if is a graph with vertices and density , and if the number of 4-cycles in is approximately , then resembles a random graph of the same density. In particular, between any two sets and of vertices the number of edges is approximately . (Here, “approximately” means "to within a small fraction of , so the statement is non-trivial only for sets and that are not too small.)
Cite
APA
Noel, J., Kral, D., Lovasz, L. M., & Sosnovec, J. (2020). Finitely forcible graphons with an almost arbitrary structure. Discrete Analysis. https://doi.org/10.19086/da.12058
Vancouver
Noel J, Kral D, Lovasz LM, Sosnovec J. Finitely forcible graphons with an almost arbitrary structure. Discrete Analysis. 2020. doi:10.19086/da.12058
BibTeX
@article{Noel2020,
author = {Noel, Jonathan and Kral, Daniel and Lovasz, Laszlo Miklos and Sosnovec, Jakub},
title = {Finitely forcible graphons with an almost arbitrary structure},
journal = {Discrete Analysis},
year = {2020},
doi = {10.19086/da.12058}
}
EUVIMED