Bounded colorings of multipartite graphs and hypergraphs
From MaRDI portal
Publication:2403698
DOI10.1016/j.ejc.2017.06.023zbMath1369.05079arXiv1601.02271OpenAlexW2963641031MaRDI QIDQ2403698
Jan Volec, Nina Kamčev, Benjamin Sudakov
Publication date: 11 September 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.02271
Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)
Related Items (3)
Properly colored Hamilton cycles in Dirac-type hypergraphs ⋮ A rainbow blow‐up lemma ⋮ A Rainbow Dirac's Theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rainbow Hamilton cycles in uniform hypergraphs
- Lopsided Lovász Local lemma and Latin transversals
- Using Lovász local lemma in the space of random injections
- On rainbow trees and cycles
- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
- Alternating Hamiltonian cycles
- A property of the colored complete graph
- Graphs with Hamiltonian cycles having adjacent lines different colours
- Extensions of results on rainbow Hamilton cycles in uniform hypergraphs
- Quest for Negative Dependency Graphs
- Properly coloured copies and rainbow copies of large graphs with small maximum degree
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- A constructive algorithm for the Lovász Local Lemma on permutations
- Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting
- A Combinatorial Theorem
- Properly colored and rainbow copies of graphs with few cherries
This page was built for publication: Bounded colorings of multipartite graphs and hypergraphs