List colorings of multipartite hypergraphs
From MaRDI portal
Publication:5216184
DOI10.1002/rsa.20848zbMath1433.05126arXiv1704.07907OpenAlexW2607522182MaRDI QIDQ5216184
Arès Méroueh, Andrew G. Thomason
Publication date: 14 February 2020
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.07907
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Online containers for hypergraphs, with applications to linear equations
- Dense uniform hypergraphs have high list chromatic number
- Hypergraph containers
- On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
- The Cameron-Erdős conjecture
- The choice number of random bipartite graphs
- The number of sum-free sets in abelian groups
- List coloring hypergraphs
- List Colourings of Regular Hypergraphs
- Greedy colorings of uniform hypergraphs
- Hypergraph list coloring and Euclidean Ramsey theory
- Limit Theorems for the Number of Empty Cells in an Equiprobable Scheme for Group Allocation of Particles
- A note on random greedy coloring of uniform hypergraphs
- On list coloring Steiner triple systems
- On the number of independent sets in expanders
- Oriented hamilton cycles in digraphs
- Improved bounds and algorithms for hypergraph 2-coloring
- Independent sets in hypergraphs
- Probability Inequalities for Sums of Bounded Random Variables
- Simple Containers for Simple Hypergraphs
- Stochastic Algorithms: Foundations and Applications
- Stirling Behavior is Asymptotically Normal
- On a combinatorial problem. II
This page was built for publication: List colorings of multipartite hypergraphs