The chromatic profile of locally bipartite graphs

DOI10.1016/j.jctb.2022.05.006zbMath1490.05073arXiv2012.10409OpenAlexW3114496877MaRDI QIDQ2673491

Freddie Illingworth

Publication date: 10 June 2022

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

graph colouringextremal graph theory

Mathematics Subject Classification ID

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

Related Items (1)

The chromatic profile of locally colourable graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the structure of triangle-free graphs of large minimum degree
• Another infinite sequence of dense triangle-free graphs
• On the chromatic number of triangle-free graphs of large minimum degree
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• Note on the structure of graphs with bounded clique number
• Triangle-free four-chromatic graphs
• The chromatic thresholds of graphs
• On a valence problem in extremal graph theory
• Dense graphs with small clique number
• Über ein Extremalproblem der Graphentheorie
• ODD Cycles of Specified Length in Non-Bipartite Graphs
• On the Structure of Dense Triangle-Free Graphs
• Triangle-Free Graphs with Large Degree
• The chromatic profile of locally colourable graphs

This page was built for publication: The chromatic profile of locally bipartite graphs