Pages that link to "Item:Q4074927"

The following pages link to Problems and results on 3-chromatic hypergraphs and some related questions (Q4074927):

Displaying 50 items.

• Moser-Tardos resampling algorithm, entropy compression method and the subset gas (Q2693173) (← links)
• Equivariant maps to subshifts whose points have small stabilizers (Q2699496) (← links)
• Extremal \(n\)-systems of sets (Q2737124) (← links)
• Coloring sparse hypergraphs (Q2813339) (← links)
• The structure of large intersecting families (Q2970053) (← links)
• FINITELY DEPENDENT COLORING (Q2971028) (← links)
• Online Ramsey Numbers and the Subgraph Query Problem (Q3295265) (← links)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
• On Conflict-Free Multi-coloring (Q3449809) (← links)
• Arithmetic Progressions and Tic-Tac-Toe Games (Q3530426) (← links)
• Coloring Block Designs is NP-Complete (Q3960717) (← links)
• Coloring Steiner Triple Systems (Q3966168) (← links)
• Optimal Construction of Edge-Disjoint Paths in Random Graphs (Q4210165) (← links)
• Commutativity in the Algorithmic Lovász Local Lemma (Q4555400) (← links)
• Partial Resampling to Approximate Covering Integer Programs (Q4575724) (← links)
• Colourings of Uniform Hypergraphs with Large Girth and Applications (Q4643316) (← links)
• (Q4726273) (← links)
• Separation dimension and degree (Q4958696) (← links)
• An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles (Q4960448) (← links)
• Finding independent transversals efficiently (Q4987260) (← links)
• Independent dominating sets in graphs of girth five (Q4993127) (← links)
• A note on two-colorability of nonuniform hypergraphs (Q5002721) (← links)
• (Q5009538) (← links)
• Hitting times for Shamir’s problem (Q5020682) (← links)
• Attacks and alignments: rooks, set partitions, and permutations (Q5026963) (← links)
• A note on saturation for $k$-wise intersecting families (Q5051355) (← links)
• Covering Metric Spaces by Few Trees (Q5091169) (← links)
• A General Framework for Hypergraph Coloring (Q5093586) (← links)
• The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘) (Q5108704) (← links)
• Extremal problems in hypergraph colourings (Q5112450) (← links)
• A short proof of Bernoulli disjointness via the local lemma (Q5130866) (← links)
• Crumbling walls: a class of practical and efficient quorum systems (Q5137330) (← links)
• Better bounds for poset dimension and boxicity (Q5217895) (← links)
• A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families (Q5222551) (← links)
• Counting Hypergraph Colorings in the Local Lemma Regime (Q5232330) (← links)
• Shearer's point process, the hard-sphere model, and a continuum Lovász local lemma (Q5233156) (← links)
• Matching criticality in intersecting hypergraphs (Q5236049) (← links)
• Non-proper edge-colouring of graphs and hereditary graph properties (Q5236091) (← links)
• (Q5743376) (← links)
• The Size Ramsey Number of Graphs with Bounded Treewidth (Q5854459) (← links)
• (Q5869336) (← links)
• Independent transversals in bipartite correspondence-covers (Q5888915) (← links)
• Properly colored and rainbow copies of graphs with few cherries (Q5890911) (← links)
• Colorings of hypergraphs with large number of colors (Q5895162) (← links)
• Diversity (Q5918313) (← links)
• Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
• Average probe complexity in quorum systems (Q5920574) (← links)
• Adaptable and conflict colouring multigraphs with no cycles of length three or four (Q6047975) (← links)
• The intersection spectrum of 3‐chromatic intersecting hypergraphs (Q6051524) (← links)
• Efficiently list‐edge coloring multigraphs asymptotically optimally (Q6052475) (← links)