Concentration for Independent Permutations

DOI10.1017/S0963548301005089zbMath1001.60014OpenAlexW2074009459MaRDI QIDQ3147277

Colin J. H. McDiarmid

Publication date: 15 December 2002

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548301005089

zbMATH Keywords

graph colouringconcentration inequality

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15)

Related Items (20)

Full rainbow matchings in graphs and hypergraphs ⋮ Stein's method for concentration inequalities ⋮ A stronger bound for the strong chromatic index (extended abstract) ⋮ An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three ⋮ A Stronger Bound for the Strong Chromatic Index ⋮ Dismantling Sparse Random Graphs ⋮ KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Colouring graphs when the number of colours is almost the maximum degree ⋮ A proof of the Barát-Thomassen conjecture ⋮ Asymptotically optimal frugal colouring ⋮ Corrigendum to ``Asymptotically optimal frugal colouring [J. Comb. Theory, Ser. B 100, No. 2, 226--246 (2010)] ⋮ Isomorphic edge disjoint subgraphs of hypergraphs ⋮ A Bernstein type inequality for sums of selections from three dimensional arrays ⋮ Theory of Classification: a Survey of Some Recent Advances ⋮ Co-degrees resilience for perfect matchings in random hypergraphs ⋮ Erdős-Szekeres type theorems for ordered uniform matchings ⋮ Variations on twins in permutations ⋮ Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree ⋮ Rumor spreading on random regular graphs and expanders

This page was built for publication: Concentration for Independent Permutations