On the maximum number of edges in \(k\)-critical graphs

DOI10.1017/s0963548323000238MaRDI QIDQ6632786

Cong Luo, Tianchi Yang, Jie Ma

Publication date: 5 November 2024

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

critical graphsstability problems

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
• Subgraphs of colour-critical graphs
• On a conjecture of Gallai concerning complete subgraphs of \(k\)-critical graphs
• On extensions of a conjecture of Gallai
• Critical graphs without triangles: an optimum density construction
• Über ein Problem von K. Zarankiewicz
• Applications of product colouring
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs

This page was built for publication: On the maximum number of edges in \(k\)-critical graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632786)