Pages that link to "Item:Q3578191"
From MaRDI portal
The following pages link to A constructive proof of the general lovász local lemma (Q3578191):
Displaying 50 items.
- Measurable versions of the Lovász local lemma and measurable graph colorings (Q2319876) (← links)
- New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions (Q2333785) (← links)
- Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma (Q2333832) (← links)
- How to play Thue games (Q2342675) (← links)
- Distributed coloring algorithms for triangle-free graphs (Q2347810) (← links)
- The local cut lemma (Q2357223) (← links)
- Rainbow Hamilton cycles and lopsidependency (Q2400558) (← links)
- Probabilistic existence of regular combinatorial structures (Q2400828) (← links)
- Improved upper bound for the degenerate and star chromatic numbers of graphs (Q2410096) (← links)
- Acyclic edge-coloring using entropy compression (Q2444732) (← links)
- Pattern avoidance in partial words over a ternary alphabet (Q2517160) (← links)
- Counting Candy Crush configurations (Q2661216) (← links)
- Edge-partitioning 3-edge-connected graphs into paths (Q2673486) (← links)
- Total functions in QMA (Q2684235) (← links)
- Expander spanning subgraphs with large girth (Q2689227) (← links)
- Mini-workshop: Descriptive combinatorics, LOCAL algorithms and random processes. Abstracts from the mini-workshop held February 13--19, 2022 (Q2693035) (← links)
- Moser-Tardos resampling algorithm, entropy compression method and the subset gas (Q2693173) (← links)
- Equivariant maps to subshifts whose points have small stabilizers (Q2699496) (← links)
- Routing in Undirected Graphs with Constant Congestion (Q2817791) (← links)
- On the Facial Thue Choice Index via Entropy Compression (Q2930037) (← links)
- DELAUNAY STABILITY VIA PERTURBATIONS (Q2939918) (← links)
- A Short Implicant of a CNF Formula with Many Satisfying Assignments (Q2942635) (← links)
- Graphs with $\chi=\Delta$ Have Big Cliques (Q2949718) (← links)
- THE LOGARITHMICALLY AVERAGED CHOWLA AND ELLIOTT CONJECTURES FOR TWO-POINT CORRELATIONS (Q2971027) (← links)
- Bandwidth and Low Dimensional Embedding (Q3088081) (← links)
- An Improvement of the Lovász Local Lemma via Cluster Expansion (Q3103621) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- On Conflict-Free Multi-coloring (Q3449809) (← links)
- A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations (Q3452821) (← links)
- A note on near-optimal coloring of shift hypergraphs (Q3467579) (← links)
- Commutativity in the Algorithmic Lovász Local Lemma (Q4555400) (← links)
- Partial Resampling to Approximate Covering Integer Programs (Q4575724) (← links)
- A Time Hierarchy Theorem for the LOCAL Model (Q4646447) (← links)
- An asymptotically tight bound on the adaptable chromatic number (Q4650185) (← links)
- New approach to nonrepetitive sequences (Q4909201) (← links)
- An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles (Q4960448) (← links)
- Acyclic edge colourings of graphs with large girth (Q4978429) (← links)
- Finding independent transversals efficiently (Q4987260) (← links)
- (Q5002746) (← links)
- (Q5009540) (← links)
- On Baire measurable colorings of group actions (Q5019557) (← links)
- Improved Bounds for Perfect Sampling of $k$-Colorings in Graphs (Q5026395) (← links)
- Algorithms for Constructing Anonymizing Arrays (Q5041207) (← links)
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
- A General Framework for Hypergraph Coloring (Q5093586) (← links)
- Counting Solutions to Random CNF Formulas (Q5096442) (← links)
- New bounds for the Moser‐Tardos distribution (Q5120743) (← links)
- A rainbow blow‐up lemma (Q5128752) (← links)
- Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture (Q5138970) (← links)
- Improved Bounds for Centered Colorings (Q5162872) (← links)
