On the density of a graph and its blowup
From MaRDI portal
Publication:602726
DOI10.1016/j.jctb.2010.07.004zbMath1208.05067arXiv0903.0198MaRDI QIDQ602726
Publication date: 5 November 2010
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0903.0198
05C42: Density (toughness, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finitely forcible graphons
- A correlation inequality for bipartite graphs
- Weak quasi-randomness for uniform hypergraphs
- On Sets of Acquaintances and Strangers at any Party
- On the Minimal Density of Triangles in Graphs
- On the Structure of Edge Graphs II
- On the Structure of Edge Graphs
- The Difficulty of Testing for Isomorphism against a Graph That Is Given in Advance
- Graphs with many r -cliques have large complete r -partite subgraphs
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On the structure of linear graphs
- Quasi-random graphs
- Efficient testing of large graphs