Counting and packing Hamilton cycles in dense graphs and oriented graphs (Q345082): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1554423888 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1212.4667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of Hamiltonian paths in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems and results in extremal combinatorics. I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3503433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4044717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint Hamilton cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the 1-factorization and Hamilton Decomposition Conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian Cycles in Regular Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian cycles in Dirac graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4745951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Hamiltonian Cycles in a Tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: On packing Hamilton cycles in \(\varepsilon\)-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Hamilton Cycles in Sparse Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Cycles in Oriented Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum degree of a graph and the existence of k-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact minimum degree condition for Hamilton cycles in oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Hamilton decompositions of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint Hamilton cycles in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of Hamilton cycles in pseudo-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton decompositions of regular expanders: applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian degree sequences in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Hamilton Decompositions of Robustly Expanding Regular Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian circuits in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of Hamiltonian cycles in Dirac graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local resilience of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691763 / rank
 
Normal rank

Latest revision as of 00:38, 13 July 2024

scientific article
Language Label Description Also known as
English
Counting and packing Hamilton cycles in dense graphs and oriented graphs
scientific article

    Statements

    Counting and packing Hamilton cycles in dense graphs and oriented graphs (English)
    0 references
    0 references
    0 references
    0 references
    25 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Hamilton cycles
    0 references
    oriented graphs
    0 references
    packing
    0 references
    counting
    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