Coloring hypergraphs with excluded minors

DOI10.1016/J.EJC.2024.103971MaRDI QIDQ6568846zbMATH OpenFDO

Authors Raphael Steiner

Publication date 8 July 2024

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJC.2024.103971

zbMATH Keywords

chromatic numbergraph minorsHadwiger conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Graph minors (05C83)

Recommendations

• Coloring graphs with forbidden minors
• Breaking the degeneracy barrier for coloring graphs with no K_t minor
• Improper colourings inspired by Hadwiger's conjecture

Cites work

• A note on Hadwiger's conjecture for \(W_5\)-free graphs with independence number two
• A special case of Hadwiger's conjecture
• Colour-critical graphs and hypergraphs
• Complete directed minors and chromatic number
• Connected matchings and Hadwiger's conjecture
• Decomposable and indecomposable critical hypergraphs
• Fractional colouring and Hadwiger's conjecture
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Higher minors and van Kampen's obstruction
• scientific article; zbMATH DE number 3102312 (Why is no real title available?)
• Hypertree-depth and minors in hypergraphs
• Linked graphs with restricted lengths
• Minors, embeddability, and extremal problems for hypergraphs
• On a special case of Hadwiger's conjecture
• On Hadwiger's Number and the Stability Number
• On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs
• On the odd-minor variant of Hadwiger's conjecture
• Packing seagulls
• Strong complete minors in digraphs
• Subgraphs of large connectivity and chromatic number
• The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs

This page was built for publication: Coloring hypergraphs with excluded minors

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