scientific article; zbMATH DE number 1523257

DOI<link itemprop=identifier href="https://doi.org/10.1002/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9" /><117::AID-RSA3>3.0.CO;2-9 10.1002/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9zbMath0956.05038MaRDI QIDQ4511485

Jeffry Kahn

Publication date: 4 March 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

uniform hypergraphmartingaleLovász local lemmarandom matchingfractional chromatic indexlist-chromatic index

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15)

Related Items (25)

New bounds for the acyclic chromatic index ⋮ Note on a problem of M. Talagrand ⋮ Fractional v. integral covers in hypergraphs of bounded edge size ⋮ List edge and list total colourings of multigraphs ⋮ Extension from precoloured sets of edges ⋮ Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design ⋮ Vertex colourings of multigraphs with forbiddances on edges ⋮ Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs ⋮ Efficiently list‐edge coloring multigraphs asymptotically optimally ⋮ Asymptotically good edge correspondence colourings ⋮ Asymptotics of the chromatic number for quasi-line graphs ⋮ List Colouring Squares of Planar Graphs ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Terminal-pairability in complete bipartite graphs ⋮ Edge-colouring graphs with local list sizes ⋮ A unified approach to distance-two colouring of graphs on surfaces ⋮ Randomly colouring graphs (a combinatorial view) ⋮ An upper bound for the chromatic number of line graphs ⋮ Coloring temporal graphs ⋮ An introduction to the discharging method via graph coloring ⋮ Asymptotically optimal frugal colouring ⋮ On the stochastic independence properties of hard-core distributions ⋮ Measurable versions of the Lovász local lemma and measurable graph colorings ⋮ Choosability, edge choosability and total choosability of outerplane graphs ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges

Cites Work

• Unnamed Item
• On a packing and covering problem
• Near perfect coverings in graphs and hypergraphs
• Concentration of measure and isoperimetric inequalities in product spaces
• On Brooks' Theorem for Sparse Graphs
• Maximum matching and a polyhedron with 0,1-vertices
• A Theorem on Coloring the Lines of a Network

This page was built for publication: