Publication:4602400

DOI10.4086/toc.2017.v013a017zbMath1387.68293MaRDI QIDQ4602400

Aravind Srinivasan, David G. Harris

Publication date: 10 January 2018

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2017.v013a017

zbMATH Keywords

Lovász local lemma; hypergraph packing; random permutations; Latin transversals; strong chromatic number; lopsided Lovász local lemma; Moser-Tardos algorithm; rainbow Hamiltonian cycles

Mathematics Subject Classification ID

05C65: Hypergraphs

05A05: Permutations, words, matrices

60C05: Combinatorial probability

05B15: Orthogonal arrays, Latin squares, Room squares

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C15: Coloring of graphs and hypergraphs

68W20: Randomized algorithms