Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5‐cycles

DOI10.1002/JGT.23021zbMath1522.05197arXiv2205.13905OpenAlexW4385630062MaRDI QIDQ6081569

Jan de Heer, Alexander Sidorenko, Iliya Bluskov

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/2205.13905

zbMATH Keywords

regular graphsTurán numbers5-cyclessystem of triples

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
• Method for construction of (3,4)-graphs
• What we know and what we do not know about Turán numbers
• On 3-Hypergraphs with Forbidden 4-Vertex Configurations
• On Sets of Acquaintances and Strangers at any Party
• Paul turán, 1910–1976: His work in graph theory

This page was built for publication: Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5‐cycles