On the Hadwiger number of Kneser graphs and their random subgraphs

DOI10.2140/INVOLVE.2019.12.1153zbMATH Open1428.05290OpenAlexW2982111635WikidataQ126983731 ScholiaQ126983731MaRDI QIDQ2278635FDOQ2278635

Authors Arran Hamm, Kristen Melton 

Publication date 5 December 2019

Published in Involve (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2140/involve.2019.12.1153

zbMATH Keywords

Kneser graphsHadwiger number

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph minors (05C83) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Recommendations

• On random subgraphs of Kneser and Schrijver graphs
• scientific article; zbMATH DE number 3865318
• Lower bound of the Hadwiger number of graphs by their average degree
• Hadwiger's conjecture for the complements of Kneser graphs
• Sharp bounds for the chromatic number of random Kneser graphs

Cites Work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3865318 (Why is no real title available?)
• Hadwiger's conjecture
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Kneser's conjecture, chromatic number, and homotopy
• Lower bound of the Hadwiger number of graphs by their average degree
• On ``stability in the Erdős-Ko-Rado theorem
• On random subgraphs of Kneser and Schrijver graphs
• On the bandwidth of the Kneser graph
• On the diameter of Kneser graphs
• On the stability of the Erdős-Ko-Rado theorem

Cited In (1)

• Title not available (Why is no real title available?)

This page was built for publication: On the Hadwiger number of Kneser graphs and their random subgraphs

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