Rainbow trees in uniformly edge‐colored graphs (Q6074865): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Rainbow Hamilton Cycles in Randomly Colored Randomly Perturbed Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest path in a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding nearly-spanning bounded degree trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected? / rank
 
Normal rank
Property / cites work
 
Property / cites work: High powers of Hamiltonian cycles in randomly augmented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power of \(k\) choices and rainbow spanning trees in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow matchings and Hamilton cycles in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large bounded degree trees in expanding graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tilings in Randomly Perturbed Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of tight Hamilton cycles in randomly perturbed hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding random edges to dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many random edges make a dense graph hamiltonian? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long paths in sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality for bounded degree spanning trees in randomly perturbed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of Hamiltonian cycles in randomly augmented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4116466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow Hamilton cycles in random graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3887496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees in sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On large matchings and cycles in sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow hamilton cycles in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicolored trees in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random perturbation of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity in randomly perturbed hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-Degree Spanning Trees in Randomly Perturbed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:53, 3 August 2024

scientific article; zbMATH DE number 7752400
Language Label Description Also known as
English
Rainbow trees in uniformly edge‐colored graphs
scientific article; zbMATH DE number 7752400

    Statements

    Rainbow trees in uniformly edge‐colored graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 October 2023
    0 references
    0 references
    edge-coloring
    0 references
    rainbow trees
    0 references
    random graphs
    0 references
    random perturbation
    0 references
    0 references
    0 references
    0 references