Rainbow trees in uniformly edge‐colored graphs
From MaRDI portal
Publication:6074865
DOI10.1002/rsa.21103zbMath1522.05087arXiv2105.08315MaRDI QIDQ6074865
Abhiruk Lahiri, Elad Aigner-Horev, Dan Hefetz
Publication date: 19 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.08315
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Long paths in sparse random graphs
- Hamiltonicity in randomly perturbed hypergraphs
- Embedding nearly-spanning bounded degree trees
- On large matchings and cycles in sparse random graphs
- Trees in sparse random graphs
- The longest path in a random graph
- Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs
- Random perturbation of sparse graphs
- Power of \(k\) choices and rainbow spanning trees in random graphs
- Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs
- Large bounded degree trees in expanding graphs
- A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
- Rainbow matchings and Hamilton cycles in random graphs
- Rainbow Hamilton cycles in random graphs and hypergraphs
- Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
- How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected?
- Multicolored trees in random graphs
- Adding random edges to dense graphs
- How many random edges make a dense graph hamiltonian?
- Rainbow Hamilton Cycles in Randomly Colored Randomly Perturbed Dense Graphs
- EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS
- Powers of Hamiltonian cycles in randomly augmented graphs
- Powers of tight Hamilton cycles in randomly perturbed hypergraphs
- Universality for bounded degree spanning trees in randomly perturbed graphs
- Tilings in Randomly Perturbed Dense Graphs
- Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs
- Rainbow hamilton cycles in random graphs
- High powers of Hamiltonian cycles in randomly augmented graphs
This page was built for publication: Rainbow trees in uniformly edge‐colored graphs
