On the chromatic number of generalized Kneser graphs and Hadamard matrices
From MaRDI portal
Publication:2280005
DOI10.1016/j.disc.2019.111682zbMath1429.05070OpenAlexW2981101200WikidataQ126998863 ScholiaQ126998863MaRDI QIDQ2280005
Mohammad Javad Moghaddamzadeh, A. H. Jafari
Publication date: 17 December 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2019.111682
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Kneser's conjecture, chromatic number, and homotopy
- What we know and what we do not know about Turán numbers
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- On the minimum size of 4-uniform hypergraphs without property \(B\)
- On the chromatic number of the general Kneser-graph
- The Chromatic Number of Kneser Hypergraphs
- A Note on a Combinatorial Problem of ErdŐS and Hajnal
- Orthogonal Designs
- On a combinatorial problem. II
This page was built for publication: On the chromatic number of generalized Kneser graphs and Hadamard matrices