Lopsided Lovász Local lemma and Latin transversals
From MaRDI portal
Publication:753819
DOI10.1016/0166-218X(91)90040-4zbMath0717.05017OpenAlexW1983085249WikidataQ106026163 ScholiaQ106026163MaRDI QIDQ753819
Publication date: 1991
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(91)90040-4
Related Items (54)
The number of distinct symbols in sections of rectangular arrays ⋮ Improved upper bound for generalized acyclic chromatic number of graphs ⋮ Covering with Latin transversals ⋮ Properly coloured copies and rainbow copies of large graphs with small maximum degree ⋮ Coloring and the Lovász local lemma ⋮ A random construction for permutation codes and the covering radius ⋮ Hypergraph colouring and the Lovász local lemma ⋮ Commutativity in the Algorithmic Lovász Local Lemma ⋮ Transversals in long rectangular arrays ⋮ The \(n\)-queens completion problem ⋮ Rainbow Hamilton cycles and lopsidependency ⋮ Bounded colorings of multipartite graphs and hypergraphs ⋮ Disproof of the neighborhood conjecture with implications to SAT ⋮ Almost color-balanced perfect matchings in color-balanced complete graphs ⋮ Can colour-blind distinguish colour palettes? ⋮ Graph Tilings in Incompatibility Systems ⋮ Efficiently list‐edge coloring multigraphs asymptotically optimally ⋮ Long directed rainbow cycles and rainbow spanning trees ⋮ How Many Conflicts Does It Need to Be Unsatisfiable? ⋮ Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel ⋮ Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree ⋮ On the facial Thue choice index of plane graphs ⋮ New bounds for the Moser‐Tardos distribution ⋮ A counterexample to Stein’s Equi-$n$-square Conjecture ⋮ Rainbow structures in locally bounded colorings of graphs ⋮ A Rainbow Dirac's Theorem ⋮ Equitable two-colorings of uniform hypergraphs ⋮ Properly colored and rainbow copies of graphs with few cherries ⋮ Online Ramsey Numbers and the Subgraph Query Problem ⋮ Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting ⋮ Rainbow Matchings: existence and counting ⋮ Rainbow perfect matchings in \(r\)-partite graph structures ⋮ On colour-blind distinguishing colour pallets in regular graphs ⋮ A Kolmogorov complexity proof of the Lovász local lemma for satisfiability ⋮ Asymptotically optimal frugal colouring ⋮ The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:4521547 Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma] ⋮ Equitable orientations of sparse uniform hypergraphs ⋮ An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles ⋮ Directed Lovász local lemma and Shearer's lemma ⋮ Rainbow matchings and Hamilton cycles in random graphs ⋮ Rainbow factors in hypergraphs ⋮ Transversals in generalized Latin squares ⋮ The Lovász Local Lemma and Satisfiability ⋮ An Improvement of the Lovász Local Lemma via Cluster Expansion ⋮ Measurable versions of the Lovász local lemma and measurable graph colorings ⋮ Transversals in \(m \times n\) arrays ⋮ A Local Lemma for Focused Stochastic Algorithms ⋮ Graph theory. Abstracts from the workshop held January 6--12, 2019 ⋮ Comparison of two convergence criteria for the variable-assignment Lopsided Lovász Local Lemma ⋮ Extensions of results on rainbow Hamilton cycles in uniform hypergraphs ⋮ Hitting times for Shamir’s problem ⋮ The lefthanded local lemma characterizes chordal dependency graphs ⋮ The local cut lemma
Cites Work
This page was built for publication: Lopsided Lovász Local lemma and Latin transversals
