Long directed rainbow cycles and rainbow spanning trees
From MaRDI portal
Publication:2189824
DOI10.1016/j.ejc.2020.103102zbMath1443.05061arXiv1711.03772OpenAlexW3015337273MaRDI QIDQ2189824
Frederik Benzing, Benjamin Sudakov, Alexey Pokrovskiy
Publication date: 16 June 2020
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.03772
Related Items (4)
Hamilton transversals in random Latin squares ⋮ A rainbow blow‐up lemma ⋮ Embedding rainbow trees with applications to graph labelling and decomposition ⋮ Repeated Patterns in Proper Colorings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey on Hamilton cycles in directed graphs
- Polychromatic Hamilton cycles
- Lopsided Lovász Local lemma and Latin transversals
- On a problem of G. Hahn about coloured Hamiltonian paths in \(K_{2n}\)
- Using Lovász local lemma in the space of random injections
- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
- Transversals of latin squares and their generalizations
- Alternating Hamiltonian cycles
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
- On packing Hamilton cycles in \(\varepsilon\)-regular graphs
- Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs
- Rainbow matchings and cycle-free partial transversals of Latin squares
- Weighted sums of certain dependent random variables
- Properly coloured copies and rainbow copies of large graphs with small maximum degree
- Hamilton circuits with many colours in properly edge-coloured complete graphs.
- Probability Inequalities for Sums of Bounded Random Variables
- A Combinatorial Theorem
- Properly colored and rainbow copies of graphs with few cherries
- A lower bound for the length of a partial transversal in a Latin square
- Graph colouring and the probabilistic method
This page was built for publication: Long directed rainbow cycles and rainbow spanning trees
