Large cycles in generalized Johnson graphs (Q6084722): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1002/jgt.23006 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W4383720925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the girth and diameter of generalized Johnson graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Johnson graphs are Hamilton-connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverses of triangular matrices and bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3879234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Subgraphs in Random Distance Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small subgraphs and their extensions in a random distance graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classification of the strongly regular generalised Johnson graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Euclidean Ramsey theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian uniform subset graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-free 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: On the chromatic number of rational five-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5707657 / 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: On the Nonexistence of Perfect Codes in the Johnson Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number, colorings, and codes of the Johnson graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new distance-4 constant weight codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of \(\mathbb R^4\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems and coverings of the space / 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: Intersection theorems with geometric consequences / 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: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to Borsuk’s conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of \(\mathbb{R}^{9}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The realization of distances within sets in Euclidean space / 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: A combinatorical proof of Kneser's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entries of the group inverse of the Laplacian matrix for generalized Johnson graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Kneser graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum bipartite subgraphs of Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers of random subgraphs of distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borsuk's problem and the chromatic numbers of some metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Geometry and Coding Theory* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Distance Graphs and Graphs of Diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4458210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4305546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the diameter of Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the probability of the occurrence of a copy of a fixed graph in a random distance graph / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/JGT.23006 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:17, 30 December 2024

scientific article; zbMATH DE number 7761631
Language Label Description Also known as
English
Large cycles in generalized Johnson graphs
scientific article; zbMATH DE number 7761631

    Statements

    Large cycles in generalized Johnson graphs (English)
    0 references
    0 references
    0 references
    6 November 2023
    0 references
    Johnson graph
    0 references
    Kneser graph
    0 references
    large cycles
    0 references
    random walk
    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
    0 references
    0 references