Pages that link to "Item:Q753819"
From MaRDI portal
The following pages link to Lopsided Lovász Local lemma and Latin transversals (Q753819):
Displaying 45 items.
- Disproof of the neighborhood conjecture with implications to SAT (Q377802) (← links)
- Can colour-blind distinguish colour palettes? (Q396838) (← links)
- On the facial Thue choice index of plane graphs (Q418875) (← links)
- Equitable two-colorings of uniform hypergraphs (Q458597) (← links)
- Rainbow perfect matchings in \(r\)-partite graph structures (Q510578) (← links)
- A Kolmogorov complexity proof of the Lovász local lemma for satisfiability (Q690463) (← links)
- Equitable orientations of sparse uniform hypergraphs (Q727210) (← links)
- Graph theory. Abstracts from the workshop held January 6--12, 2019 (Q782972) (← links)
- The number of distinct symbols in sections of rectangular arrays (Q819815) (← links)
- Coloring and the Lovász local lemma (Q847296) (← links)
- A random construction for permutation codes and the covering radius (Q851770) (← links)
- Transversals in long rectangular arrays (Q856842) (← links)
- Asymptotically optimal frugal colouring (Q965250) (← links)
- Covering with Latin transversals (Q1345959) (← links)
- Hypergraph colouring and the Lovász local lemma (Q1356486) (← links)
- Improved upper bound for generalized acyclic chromatic number of graphs (Q1617036) (← links)
- Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree (Q1689912) (← links)
- Comparison of two convergence criteria for the variable-assignment Lopsided Lovász Local Lemma (Q2094876) (← links)
- The \(n\)-queens completion problem (Q2157925) (← links)
- Long directed rainbow cycles and rainbow spanning trees (Q2189824) (← links)
- On colour-blind distinguishing colour pallets in regular graphs (Q2251135) (← links)
- Directed Lovász local lemma and Shearer's lemma (Q2294597) (← links)
- Rainbow factors in hypergraphs (Q2299634) (← links)
- Measurable versions of the Lovász local lemma and measurable graph colorings (Q2319876) (← links)
- Transversals in \(m \times n\) arrays (Q2320748) (← links)
- Extensions of results on rainbow Hamilton cycles in uniform hypergraphs (Q2345522) (← links)
- The local cut lemma (Q2357223) (← links)
- Rainbow Hamilton cycles and lopsidependency (Q2400558) (← links)
- Bounded colorings of multipartite graphs and hypergraphs (Q2403698) (← links)
- The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma (Q2487791) (← links)
- Almost color-balanced perfect matchings in color-balanced complete graphs (Q2666593) (← links)
- Rainbow matchings and Hamilton cycles in random graphs (Q2811161) (← links)
- Rainbow Matchings: existence and counting (Q2857432) (← links)
- Properly coloured copies and rainbow copies of large graphs with small maximum degree (Q2904592) (← links)
- An Improvement of the Lovász Local Lemma via Cluster Expansion (Q3103621) (← links)
- The lefthanded local lemma characterizes chordal dependency graphs (Q3145842) (← links)
- Online Ramsey Numbers and the Subgraph Query Problem (Q3295265) (← links)
- Hitting times for Shamir’s problem (Q5020682) (← links)
- New bounds for the Moser‐Tardos distribution (Q5120743) (← links)
- Rainbow structures in locally bounded colorings of graphs (Q5128755) (← links)
- Transversals in generalized Latin squares (Q5225021) (← links)
- A counterexample to Stein’s Equi-$n$-square Conjecture (Q5377048) (← links)
- Graph Tilings in Incompatibility Systems (Q6046822) (← links)
- Efficiently list‐edge coloring multigraphs asymptotically optimally (Q6052475) (← links)
- Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel (Q6076732) (← links)
