The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets
From MaRDI portal
Publication:2191992
DOI10.1134/S000143462003013XzbMath1442.05069OpenAlexW3018079745MaRDI QIDQ2191992
T. M. Shaikheeva, Dmitriy A. Shabanov
Publication date: 26 June 2020
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s000143462003013x
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
Asymptotics of the independence number of a random subgraph of the graph \(G(n, r, < s)\) ⋮ Estimate of the number of edges in subgraphs of a Johnson graph
Cites Work
- Unnamed Item
- On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
- On the number of independent sets in simple hypergraphs
- Colorings of \(b\)-simple hypergraphs
- A note on panchromatic colorings
- Panchromatic colorings of random hypergraphs
- On small \(n\)-uniform hypergraphs with positive discrepancy
- Panchromatic 3-colorings of random hypergraphs
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- On a generalization of Rubin's theorem
- The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
- A note on random greedy coloring of uniform hypergraphs
- Choice Numbers of Graphs: a Probabilistic Approach
- Colourings of Uniform Hypergraphs with Large Girth and Applications
- Improved bounds and algorithms for hypergraph 2-coloring
- On the asymptotic value of the choice number of complete multi‐partite graphs
- On a combinatorial problem. II
- Colorings of hypergraphs with large number of colors
This page was built for publication: The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets
