Singular Turán numbers and worm-colorings

DOI10.7151/dmgt.2335zbMath1493.05099arXiv1909.04980OpenAlexW3035707673MaRDI QIDQ2158187

Máté Vizer, Dániel Gerbner, Zsolt Tuza, Balázs Patkós

Publication date: 26 July 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.04980

zbMATH Keywords

Turán numbersingular Turán numbersWORM-coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10)

Related Items

Saturation problems with regularity constraints ⋮ Regular Tur\'an numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Turán theorems with repeated degrees
• Maximum \(K_{r+1}\)-free graphs which are not \(r\)-partite.
• Worm colorings
• On the non-(p-1)-partite K_{p}-free graphs
• Extremal Finite Set Theory
• On maximal paths and circuits of graphs
• Singular Ramsey and Turán numbers
• Graphentheoretische Extremalprobleme
• The History of Degenerate (Bipartite) Extremal Graph Problems