Concerning a conjecture on matching Kneser graphs

DOI10.1016/j.dam.2024.01.015OpenAlexW4391243353WikidataQ129309237 ScholiaQ129309237MaRDI QIDQ6124424

Saeed Shaebani

Publication date: 27 March 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2024.01.015

zbMATH Keywords

chromatic numbergeneralized Turán numbermatching Kneser graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• On the chromatic number of general Kneser hypergraphs
• Kneser's conjecture, chromatic number, and homotopy
• Chromatic number via Turán number
• On the Chromatic Number of Matching Kneser Graphs

This page was built for publication: Concerning a conjecture on matching Kneser graphs