On the Structure of Graphs with Given Odd Girth and Large Minimum Degree

DOI10.1002/jgt.21840zbMath1321.05124arXiv1602.03904OpenAlexW1937054029MaRDI QIDQ2947860

Mathias Schacht, Silvia Messuti

Publication date: 29 September 2015

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

graph homomorphismsextremal graph theoryAndrasfai-Erdős-Sos theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

On the local density problem for graphs of given odd-girth ⋮ Regular Tur\'an numbers

Cites Work

• On the structure of triangle-free graphs of large minimum degree
• Graphs with odd girth at least seven and high minimum degree
• On the chromatic number of triangle-free graphs of large minimum degree
• A 4-colour problem for dense triangle-free graphs
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• Triangle-free four-chromatic graphs
• On a valence problem in extremal graph theory
• Homomorphisms of graphs into odd cycles
• Independence and graph homomorphisms graph homomorphisms
• Triangle-Free Graphs with Large Degree
• On the Möbius Ladders

This page was built for publication: On the Structure of Graphs with Given Odd Girth and Large Minimum Degree