The choice number of random bipartite graphs
From MaRDI portal
Publication:1293418
DOI10.1007/BF01608526zbMath0927.05028OpenAlexW2005834551MaRDI QIDQ1293418
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
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)
Related Items (12)
Asymmetric list sizes in bipartite graphs ⋮ Independent transversals in bipartite correspondence-covers ⋮ Coloring bipartite graphs with semi-small list size ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Packing list‐colorings ⋮ Dense uniform hypergraphs have high list chromatic number ⋮ Two problems on independent sets in graphs ⋮ On generalized choice and coloring numbers ⋮ Cooperative colorings of trees and of bipartite graphs ⋮ List colorings of multipartite hypergraphs ⋮ Separation Choosability and Dense Bipartite Induced Subgraphs ⋮ Hypergraph list coloring and Euclidean Ramsey theory
Cites Work
This page was built for publication: The choice number of random bipartite graphs