Hamiltonian uniform subset graphs
From MaRDI portal
The uniform subset graph G(n,k,t) is defined to have all k-subsets of an n-set as vertices and edges joining k-subsets intersecting at t elements. The authors conjecture that G(n,k,t) is Hamiltonian when it is different from the Petersen graph and does possess cycles. We verify this conjecture for \(k-t=1,2,3\) and for suitably large n when \(t=0,1\).
Recommendations
- scientific article; zbMATH DE number 638692
- Publication:3496361
- Hamiltonian graphs involving neighborhood unions
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
- scientific article; zbMATH DE number 2177303
- Hamiltonicity, neighborhood union and partially square graphs
- Hamiltonian-connected graphs
- Hamiltonian Kneser graphs
Cites work
- A note on Hamiltonian circuits
- Hamilton cycles in regular 2-connected graphs
- scientific article; zbMATH DE number 3735816 (Why is no real title available?)
- scientific article; zbMATH DE number 3600077 (Why is no real title available?)
- scientific article; zbMATH DE number 3380659 (Why is no real title available?)
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Kneser's conjecture, chromatic number, and homotopy
- On graphs with given automorphism group
- The footballers of Croam
- The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\)
- The Rugby footballers of Croam
Cited in
(38)- Triangle-free Hamiltonian Kneser graphs
- The super-connectivity of Kneser graphs
- Automorphism groups of graph covers and uniform subset graphs
- Diameter bounds and recursive properties of Full-Flag Johnson graphs
- Kneser graphs are Hamiltonian for \(n\geq 3k\)
- The \(p\)-restricted edge-connectivity of Kneser graphs
- Spectrum of Johnson graphs
- Binary codes and partial permutation decoding sets from the odd graphs
- Codes from the incidence matrices of graphs on 3-sets
- A bipartite Erdős-Ko-Rado theorem
- On the girth and diameter of generalized Johnson graphs
- scientific article; zbMATH DE number 4170947 (Why is no real title available?)
- scientific article; zbMATH DE number 4070937 (Why is no real title available?)
- General graph pebbling
- scientific article; zbMATH DE number 638692 (Why is no real title available?)
- Arrangements of \(k\)-sets with intersection constraints
- Binary codes and partial permutation decoding sets from the Johnson graphs
- Sparse Kneser graphs are Hamiltonian
- The super-connectivity of the Kneser graph \(KG(n,3)\)
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
- Hamiltonian-connected graphs with additional properties
- Bipartite Kneser graphs are Hamiltonian
- Bipartite Kneser graphs are Hamiltonian
- A minimum-change version of the Chung-Feller theorem for Dyck paths
- Large cycles in generalized Johnson graphs
- Dominating sets for uniform subset graphs
- Kneser graphs are Hamiltonian
- The odd girth of generalized Johnson graphs
- A combinatorial problem related to the classical probability
- On the super (edge)-connectivity of generalized Johnson graphs
- On the target pebbling conjecture
- Many Hamiltonian subsets in large graphs with given density
- A note on P_k-decomposition of the Kneser graph
- Four cycle decomposition of K(n, 2)
- Kneser graphs are Hamiltonian (extended abstract)
- Kneser graphs are Hamiltonian
- Nonuniform subset graphs associated with any graph
- Diameters of uniform subset graphs
This page was built for publication: Hamiltonian uniform subset graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1071032)
