Regular Turán numbers and some Gan–Loh–Sudakov‐type problems
From MaRDI portal
Publication:6093139
DOI10.1002/jgt.22857zbMath1522.05198arXiv1911.08452WikidataQ114236123 ScholiaQ114236123MaRDI QIDQ6093139
Ross J. Kang, Rémi de Joannis de Verclos, Stijn Cambie
Publication date: 5 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.08452
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- The clique density theorem
- On a theorem of Rademacher-Turán
- Extremal regular graphs with prescribed odd girth
- Cycle lengths and minimum degree of graphs
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- Many cliques with few edges and bounded maximum degree
- Regular Turán numbers of complete bipartite graphs
- Many triangles with few edges
- An Entropy Approach to the Hard-Core Model on Bipartite Graphs
- On Sets of Acquaintances and Strangers at any Party
- On the Minimal Density of Triangles in Graphs
- The Number of Independent Sets in a Regular Graph
- ODD Cycles of Specified Length in Non-Bipartite Graphs
- The maximum number of triangles in a graph of given maximum degree
- Regular Tur\'an numbers
- Maximizing the Number of Independent Sets of a Fixed Size
- Two improvements of a result concerning a problem of K. Zarankiewicz
- On a problem of K. Zarankiewicz
- On the structure of linear graphs
- Extremal non-bipartite regular graphs of girth 4
- Many \(T\) copies in \(H\)-free graphs
- On the maximum number of copies of H in graphs with given size and order
This page was built for publication: Regular Turán numbers and some Gan–Loh–Sudakov‐type problems
