Linearly many rainbow trees in properly edge-coloured complete graphs (Q723883): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q130069422, #quickstatements; #temporary_batch_1728052013107
 
(4 intermediate revisions by 4 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2609209176 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2609209176 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1703.07301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicolored trees in complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicolored Parallelisms of Isomorphic Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicolored trees in complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint rainbow spanning trees in complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kotzig Factorizations: Existence and Computational Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4533372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicolored Isomorphic Spanning Trees in Complete Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow spanning trees in complete graphs colored by one‐factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2715971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of G. Hahn about coloured Hamiltonian paths in \(K_{2n}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properly colored and rainbow copies of graphs with few cherries / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130069422 / rank
 
Normal rank

Latest revision as of 15:41, 4 October 2024

scientific article
Language Label Description Also known as
English
Linearly many rainbow trees in properly edge-coloured complete graphs
scientific article

    Statements

    Identifiers

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