Sparse Kneser graphs are Hamiltonian (Q5006324): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1112/jlms.12406 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2952494337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5650421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Kneser's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4063504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3936766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing All Maps into a Sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending continuous maps / 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: Hamiltonian uniform subset 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: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for constructing de Bruijn sequences via simple successor rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Short Proof of Kneser's Conjecture / 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: 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: Shorthand universal cycles for permutations / 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: Universal cycles for permutations / 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: Explicit 2-factorizations of the odd graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions via Hamiltonian theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957449 / 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: A combinatorical proof of Kneser's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The footballers of Croam / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the middle levels conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant-time algorithm for middle levels Gray codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimum-change version of the Chung-Feller theorem for Dyck paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite Kneser graphs are Hamiltonian / 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: Q4236280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Kneser coloring theorems with combinatorial proofs / rank
 
Normal rank

Revision as of 09:24, 26 July 2024

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

    Statements

    Sparse Kneser graphs are Hamiltonian (English)
    0 references
    0 references
    0 references
    0 references
    13 August 2021
    0 references
    Hamilton cycle
    0 references
    odd graph
    0 references
    vertex-transitive graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references