Cliques in \(C_4\)-free graphs of large minimum degree

DOI10.1007/s10998-016-0156-xzbMath1399.05170arXiv1509.05857OpenAlexW2248254184MaRDI QIDQ524175

Gábor N. Sárközy, András Gyárfás

Publication date: 25 April 2017

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

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

zbMATH Keywords

regular graphs\(C_4\)-free graphslarge cliques

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Large cliques in hypergraphs with forbidden substructures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large cliques in \(C_4\)-free graphs
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• Large regular graphs with no induced \(2K_ 2\)
• A bound on the strong chromatic index of a graph