ON A PROBLEM OF ERDŐS ABOUT GRAPHS WHOSE SIZE IS THE TURÁN NUMBER PLUS ONE

DOI10.1017/S000497272100040XzbMath1486.05158arXiv2001.11723OpenAlexW3165173314MaRDI QIDQ5069262

Pu Qiao, Xingzhi Zhan

Publication date: 8 April 2022

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

bookErdős problem4-cycleextremal graph theorystarTurán number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Related Items (1)

On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory

Cites Work

• Extremal graphs without 4-cycles
• Graphs without quadrilaterals
• On the Turán number for the hexagon
• Graphs without four-cycles
• On the Number of Complete Subgraphs of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: ON A PROBLEM OF ERDŐS ABOUT GRAPHS WHOSE SIZE IS THE TURÁN NUMBER PLUS ONE