Regular Tur\'an numbers
From MaRDI portal
Publication:5139696
zbMath1453.05049arXiv1911.00109MaRDI QIDQ5139696
Publication date: 10 December 2020
Full work available at URL: https://arxiv.org/abs/1911.00109
Enumeration in graph theory (05C30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (3)
Saturation problems with regularity constraints ⋮ Regular Turán numbers and some Gan–Loh–Sudakov‐type problems ⋮ Unnamed Item
Cites Work
- Homomorphism thresholds for odd cycles
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- The chromatic thresholds of graphs
- Singular Turán numbers and worm-colorings
- On the Structure of Graphs with Given Odd Girth and Large Minimum Degree
- Small dense subgraphs of polarity graphs and the extremal number for the 4-cycle
- Singular Ramsey and Turán numbers
- Graphentheoretische Extremalprobleme
- The homomorphism threshold of ‐free graphs
- Some Theorems on Abstract Graphs
- On the structure of linear graphs
This page was built for publication: Regular Tur\'an numbers