Hamiltonian uniform subset graphs
From MaRDI portal
Publication:1071032
DOI10.1016/0095-8956(87)90044-XzbMath0585.05021OpenAlexW2008208796MaRDI QIDQ1071032
Publication date: 1987
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(87)90044-x
Related Items
A bipartite Erdős-Ko-Rado theorem ⋮ The super-connectivity of Kneser graphs ⋮ Automorphism groups of graph covers and uniform subset graphs ⋮ On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs ⋮ On the girth and diameter of generalized Johnson graphs ⋮ General graph pebbling ⋮ Large cycles in generalized Johnson graphs ⋮ Dominating sets for uniform subset graphs ⋮ Triangle-free Hamiltonian Kneser graphs ⋮ Arrangements of \(k\)-sets with intersection constraints ⋮ Bipartite Kneser graphs are Hamiltonian ⋮ Bipartite Kneser graphs are Hamiltonian ⋮ Binary codes and partial permutation decoding sets from the Johnson graphs ⋮ The super-connectivity of Kneser graph KG(n,3) ⋮ Binary codes and partial permutation decoding sets from the odd graphs ⋮ Diameter bounds and recursive properties of Full-Flag Johnson graphs ⋮ The \(p\)-restricted edge-connectivity of Kneser graphs ⋮ Codes from the incidence matrices of graphs on 3-sets ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ Diameters of uniform subset graphs ⋮ Sparse Kneser graphs are Hamiltonian ⋮ Kneser graphs are Hamiltonian for \(n\geq 3k\) ⋮ Spectrum of Johnson graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Kneser's conjecture, chromatic number, and homotopy
- The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\)
- On graphs with given automorphism group
- Hamilton cycles in regular 2-connected graphs
- The Rugby footballers of Croam
- A note on Hamiltonian circuits
- The footballers of Croam
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
This page was built for publication: Hamiltonian uniform subset graphs
