Pages that link to "Item:Q4074927"
From MaRDI portal
The following pages link to Problems and results on 3-chromatic hypergraphs and some related questions (Q4074927):
Displaying 50 items.
- Mallows permutations and finite dependence (Q2184821) (← links)
- Long directed rainbow cycles and rainbow spanning trees (Q2189824) (← links)
- Concepts on coloring of cluster hypergraphs with application (Q2196923) (← links)
- 2-colorings of hypergraphs with large girth (Q2197249) (← links)
- Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs (Q2205125) (← links)
- Random bipartite posets and extremal problems (Q2220979) (← links)
- Random hypergraphs and property B (Q2225409) (← links)
- Blowup Ramsey numbers (Q2225443) (← links)
- A note on kernels of intersecting families (Q2277266) (← links)
- Recognizing binary shuffle squares is \textsf{NP}-hard (Q2285126) (← links)
- Directed Lovász local lemma and Shearer's lemma (Q2294597) (← links)
- Coloring hypergraphs with bounded cardinalities of edge intersections (Q2297713) (← links)
- Acyclic coloring of graphs and entropy compression method (Q2297725) (← links)
- Ergodic theorems for the shift action and pointwise versions of the Abért-Weiss theorem (Q2303689) (← links)
- Small simplicial complexes with prescribed torsion in homology (Q2316798) (← links)
- Measurable versions of the Lovász local lemma and measurable graph colorings (Q2319876) (← links)
- Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma (Q2333832) (← links)
- Blocking sets of certain line sets related to a hyperbolic quadric in \(\mathrm{PG}(3, q)\) (Q2334547) (← links)
- On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method (Q2341076) (← links)
- \((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs (Q2341713) (← links)
- Around Erdős-Lovász problem on colorings of non-uniform hypergraphs (Q2352063) (← links)
- On coupon colorings of graphs (Q2354722) (← links)
- The local cut lemma (Q2357223) (← links)
- Waiter-client and client-waiter colourability and \(k\)-SAT games (Q2363109) (← links)
- Rainbow Hamilton cycles and lopsidependency (Q2400558) (← links)
- Probabilistic existence of regular combinatorial structures (Q2400828) (← links)
- Bounded colorings of multipartite graphs and hypergraphs (Q2403698) (← links)
- 3-colouring for dually chordal graphs and generalisations (Q2404614) (← links)
- List star edge-coloring of \(k\)-degenerate graphs and \(K_4\)-minor free graphs (Q2414472) (← links)
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension (Q2415381) (← links)
- Panchromatic 3-colorings of random hypergraphs (Q2422211) (← links)
- DP-colorings of hypergraphs (Q2422217) (← links)
- Choosability of graphs with infinite sets of forbidden differences (Q2462372) (← links)
- 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs (Q2509706) (← links)
- Coloring \(d\)-embeddable \(k\)-uniform hypergraphs (Q2514227) (← links)
- Fast winning strategies in maker-breaker games (Q2519013) (← links)
- On defining sets for projective planes (Q2576848) (← links)
- Majority colourings of digraphs (Q2628255) (← links)
- Secret sharing on large girth graphs (Q2632835) (← links)
- Contraction of areas vs. topology of mappings (Q2636916) (← links)
- On the stability of Baer subplanes (Q2662801) (← links)
- Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge (Q2665958) (← links)
- On some generalizations of the property B problem of an \(n\)-uniform hypergraph (Q2671957) (← links)
- Random constructions of hypergraphs with large girth and without panchromatic colorings (Q2671969) (← links)
- Asymptotic linearity of binomial random hypergraphs via cluster expansion under graph-dependence (Q2672967) (← links)
- Edge-partitioning 3-edge-connected graphs into paths (Q2673486) (← links)
- Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms (Q2684542) (← links)
- Cooperative colorings of forests (Q2684895) (← 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)
