Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal
From MaRDI portal
Publication:4982284
DOI10.1002/jgt.21801zbMath1309.05138arXiv1306.2020OpenAlexW2126234938MaRDI QIDQ4982284
Nathan Linial, Avraham Morgenstern
Publication date: 24 March 2015
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.2020
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Related Items (3)
A note on the inducibility of 4-vertex graphs ⋮ Frustrated triangles ⋮ On the Number of 4-Cycles in a Tournament
Cites Work
- 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
- Ramsey-type theorems
- Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
- Graph products and monochromatic multiplicities
- Non-Ramsey graphs are \(c\log n\)-universal
- Bounds for graph regularity and removal lemmas
- The number of cliques in graphs of given order and size
- On Sets of Acquaintances and Strangers at any Party
- On the Minimal Density of Triangles in Graphs
- Universality of Graphs with Few Triangles and Anti-Triangles
- Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
- On the 3‐Local Profiles of Graphs
- Induced Ramsey-type theorems
- Efficient testing of large graphs
- Ramsey-type theorems with forbidden subgraphs
This page was built for publication: Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal
