The choice number of random bipartite graphs
From MaRDI portal
Publication:1293418
DOI10.1007/BF01608526zbMATH Open0927.05028OpenAlexW2005834551MaRDI QIDQ1293418FDOQ1293418
Michael Krivelevich, Noga Alon
Publication date: 28 June 1999
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01608526
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)
Cites Work
Cited In (18)
- Asymmetric list sizes in bipartite graphs
- On generalized choice and coloring numbers
- Hypergraph list coloring and Euclidean Ramsey theory
- Two problems on independent sets in graphs
- Title not available (Why is that?)
- Cooperative colorings of trees and of bipartite graphs
- List colorings of multipartite hypergraphs
- Packing list‐colorings
- On the asymptotic value of the choice number of complete multi‐partite graphs
- Coloring bipartite graphs with semi-small list size
- Dense uniform hypergraphs have high list chromatic number
- Graph and hypergraph colouring via nibble methods: a survey
- The Choice Number of Dense Random Graphs
- Title not available (Why is that?)
- On a product dimension of bipartite graphs
- Separation Choosability and Dense Bipartite Induced Subgraphs
- Independent transversals in bipartite correspondence-covers
- A precise condition for independent transversals in bipartite covers
This page was built for publication: The choice number of random bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293418)