Universality of Graphs with Few Triangles and Anti-Triangles
From MaRDI portal
Publication:5366905
DOI10.1017/S0963548315000188zbMath1372.05107arXiv1401.5735MaRDI QIDQ5366905
Publication date: 10 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.5735
Extremal problems in graph theory (05C35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ramsey-type theorems
- On a property of the class of n-colorable graphs
- On Sets of Acquaintances and Strangers at any Party
- A Disproof of a Conjecture of Erdős in Ramsey Theory
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
- Quasi-random graphs
- Efficient testing of large graphs