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.
- \((1, j)\)-set problem in graphs (Q294556) (← links)
- New bounds for the acyclic chromatic index (Q294561) (← links)
- Bandwidth and low dimensional embedding (Q388456) (← links)
- Application of entropy compression in pattern avoidance (Q405191) (← links)
- Improved bounds on coloring of graphs (Q412254) (← links)
- Colouring graphs when the number of colours is almost the maximum degree (Q462929) (← links)
- A note on the discrepancy of matrices with bounded row and column sums (Q488272) (← links)
- On weak odd domination and graph-based quantum secret sharing (Q496043) (← links)
- Generating square-free words efficiently (Q496050) (← links)
- Pathwidth and nonrepetitive list coloring (Q504976) (← links)
- Hölder-type inequalities and their applications to concentration and correlation bounds (Q505059) (← links)
- Acyclic edge coloring through the Lovász local lemma (Q507595) (← links)
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- Colorful strips (Q659707) (← links)
- A Kolmogorov complexity proof of the Lovász local lemma for satisfiability (Q690463) (← links)
- Partial covering arrays: algorithms and asymptotics (Q726106) (← links)
- Equitable orientations of sparse uniform hypergraphs (Q727210) (← links)
- A short implicant of a CNF formula with many satisfying assignments (Q727982) (← links)
- Witness trees in the Moser-Tardos algorithmic Lovász local lemma and Penrose trees in the hard-core lattice gas (Q743431) (← links)
- Acyclic coloring of graphs without bichromatic long path (Q889416) (← links)
- Asymptotically optimal frugal colouring (Q965250) (← links)
- On a combinatorial framework for fault characterization (Q1616211) (← links)
- The list chromatic number of graphs with small clique number (Q1633755) (← links)
- Generalized arboricity of graphs with large girth (Q1732768) (← links)
- Asymptotic and constructive methods for covering perfect hash families and covering arrays (Q1741930) (← links)
- The Lovász local lemma and variable strength covering arrays (Q1742696) (← links)
- Generalized acyclic edge colorings via entropy compression (Q1743494) (← links)
- On the paper of Pascal Schweitzer concerning similarities between incompressibility methods and the Lovász local lemma (Q1944918) (← links)
- Towards the linear arboricity conjecture (Q1985445) (← links)
- Abstract polymer gas: a simple inductive proof of the Fernández-Procacci criterion (Q1986093) (← links)
- An upper bound for the choice number of star edge coloring of graphs (Q2008856) (← links)
- Reliable communication over highly connected noisy networks (Q2010609) (← links)
- Compressibility and probabilistic proofs (Q2011640) (← links)
- Entropy compression versus Lovász local lemma (Q2020021) (← links)
- Coloring graphs without bichromatic cycles or paths (Q2045232) (← links)
- Train tracks with gaps: applying the probabilistic method to trains (Q2062121) (← links)
- Partial Resampling to Approximate Covering Integer Programs (Q4575724) (← links)
- An asymptotically tight bound on the adaptable chromatic number (Q4650185) (← links)
- New approach to nonrepetitive sequences (Q4909201) (← links)
- Acyclic edge colourings of graphs with large girth (Q4978429) (← links)
- (Q5002746) (← links)
- (Q5009540) (← links)
- On Baire measurable colorings of group actions (Q5019557) (← links)
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
- New bounds for the Moser‐Tardos distribution (Q5120743) (← links)
- A rainbow blow‐up lemma (Q5128752) (← links)
- Improved Bounds for Centered Colorings (Q5162872) (← links)
- (Q5240417) (← links)
- O(log m)-approximation for the routing open shop problem (Q5247701) (← links)
- Hats, auctions and derandomization (Q5252259) (← links)
