Andrásfai and Vega graphs in Ramsey–Turán theory
From MaRDI portal
Publication:6056773
DOI10.1002/jgt.22682zbMath1522.05232arXiv2002.01498OpenAlexW3165005223MaRDI QIDQ6056773
Christian Reiher, Tomasz Łuczak, Joanna Polcyn
Publication date: 4 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.01498
Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- More results on Ramsey-Turán type problems
- On the structure of triangle-free graphs of large minimum degree
- Triangle-free graphs whose independence number equals the degree
- On a Ramsey-Turán type problem
- Another infinite sequence of dense triangle-free graphs
- Solution-free sets for linear equations.
- On the chromatic number of triangle-free graphs of large minimum degree
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- Triangle-free four-chromatic graphs
- The chromatic thresholds of graphs
- On the Ramsey-Turán density of triangles
- On the local density problem for graphs of given odd-girth
- The Ramsey-Turán problem for cliques
- On a valence problem in extremal graph theory
- Über ein Extremalproblem der Graphentheorie
- ODD Cycles of Specified Length in Non-Bipartite Graphs
- On the structure of linear graphs
- Ramsey-Turán theory
