Tight bounds towards a conjecture of Gallai Jun Gao1

DOI10.1007/S00493-023-00020-ZMaRDI QIDQ6081376zbMATH OpenOpenAlexWikidataFDO

Authors Jun Gao, Jie Ma

Publication date 4 October 2023

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-023-00020-z

zbMATH Keywords

\(k\)-critical graphscliquesGallai's conjecturelinear algebra methods

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• On a conjecture of Gallai concerning complete subgraphs of \(k\)-critical graphs
• On extensions of a conjecture of Gallai
• scientific article; zbMATH DE number 3979084
• Colour-critical graphs with few edges
• Gallai-Ramsey numbers for graphs with chromatic number three

This page was built for publication: Tight bounds towards a conjecture of Gallai Jun Gao1

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