Kneser graphs are Hamiltonian (Q6419900): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the girth and diameter of generalized Johnson graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5650421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4063504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proof that Kneser graphs are Hamiltonian for \(n \geqslant 4k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3936766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gray codes with restricted density / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the boxicity of Kneser graphs and complements of line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian uniform subset graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser graphs are Hamiltonian for \(n\geq 3k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-free Hamiltonian Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameters of uniform subset graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the diameter of generalized Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binomial and \(q\)-binomial coefficient inequalities related to the hamiltonicity of the Kneser graphs and their \(q\)-analogues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly adjacent gray codes for the symmetric group / rank
 
Normal rank
Property / cites work
 
Property / cites work: The odd girth of the generalised Kneser graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Hamilton Paths and a Minimal Change Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for generating subsets of fixed size with a strong minimal change property / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of the general Kneser-graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser graphs are like Swiss cheese / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chomp on generalized Kneser graphs and others / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating the hamiltonian problem—A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cayley digraphs and (1,j,n)-sequencings of the alternating groups \(A_ n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong versions of Sperner's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of the middle levels theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4166784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Snake-in-the-Box Codes for Rank Modulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of generalized Kneser graphs and Hadamard matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the Hamilton-connectedness of certain vertex-transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles in the middle two layers of the discrete cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inductive construction for Hamilton cycles in Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large cycles in random generalized Johnson graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth of the generalized Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser's conjecture, chromatic number, and homotopy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rugby footballers of Croam / rank
 
Normal rank
Property / cites work
 
Property / cites work: The footballers of Croam / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6134965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the middle levels conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Gray codes -- an updated survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Kneser graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite Kneser graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent interchange generation of combinations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An explicit universal cycle for the ( <i>n</i> -1)-permutations of an <i>n</i> -set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Combinatorial Gray Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Sigma-Tau Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4458210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-2 Cyclic Chaining of Constant-Weight Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the diameter of Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic numbers of Kneser-type graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for generation of permutations / rank
 
Normal rank

Latest revision as of 13:23, 4 December 2024

scientific article; zbMATH DE number 7844645
Language Label Description Also known as
English
Kneser graphs are Hamiltonian
scientific article; zbMATH DE number 7844645

    Statements

    7 December 2022
    0 references
    math.CO
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers