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.
- Colorings of \(b\)-simple hypergraphs (Q1689874) (← links)
- Panchromatic 3-coloring of a random hypergraph (Q1690010) (← links)
- A note on panchromatic colorings (Q1690224) (← links)
- The lonely runner problem for lacunary sequences (Q1709528) (← links)
- The Lovász local lemma and variable strength covering arrays (Q1742696) (← links)
- A note on a series of families constructed over the cyclic graph (Q1747761) (← links)
- The Cayley isomorphism property for Cayley maps (Q1753007) (← links)
- Coloring cross-intersecting families (Q1753012) (← links)
- Assouad's theorem with dimension independent of the snowflaking (Q1759761) (← links)
- Generalizations of the Kolmogorov-Barzdin embedding estimates (Q1759766) (← links)
- Testing hypergraph colorability (Q1770424) (← links)
- Maximal intersecting families and affine regular polygons in \(PG(2,q)\) (Q1812686) (← links)
- Graphs with a small number of distinct induced subgraphs (Q1823262) (← links)
- Minimum number of elements of representing a set system of given rank (Q1823939) (← links)
- The star arboricity of graphs (Q1825208) (← links)
- Edge weights and vertex colours (Q1826962) (← links)
- Variations on a game (Q1836601) (← links)
- On Erdős-Rado numbers (Q1842571) (← links)
- Uniform intersecting families with covering number four (Q1894015) (← links)
- Branching rules for satisfiability (Q1904401) (← links)
- Some properties of non-bicolorable hypergraphs and the four-color problem (Q1917261) (← links)
- Maximal intersection critical families of finite sets (Q1923504) (← links)
- Strengthening hash families and compressive sensing (Q1932362) (← links)
- On cycle systems with specified weak chromatic number (Q1957974) (← links)
- Towards the linear arboricity conjecture (Q1985445) (← links)
- Weighted dependency graphs (Q1990226) (← links)
- Panchromatic colorings of random hypergraphs (Q1996843) (← links)
- Polychromatic colorings and cover decompositions of hypergraphs (Q2007510) (← links)
- Reliable communication over highly connected noisy networks (Q2010609) (← links)
- Entropy compression versus Lovász local lemma (Q2020021) (← links)
- Injective edge-coloring of graphs with given maximum degree (Q2033899) (← links)
- Coloring graphs without bichromatic cycles or paths (Q2045232) (← links)
- Randomized construction of complexes with large diameter (Q2046446) (← links)
- Variations on twins in permutations (Q2048547) (← links)
- Train tracks with gaps: applying the probabilistic method to trains (Q2062121) (← links)
- When Janson meets McDiarmid: Bounded difference inequalities under graph-dependence (Q2070641) (← links)
- On the maximum number of distinct intersections in an intersecting family (Q2075511) (← links)
- On the maximal number of elements pairwise generating the symmetric group of even degree (Q2075524) (← links)
- Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings (Q2084984) (← links)
- New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\) (Q2088728) (← links)
- Injective edge-coloring of graphs with small weight (Q2093106) (← links)
- From one to many rainbow Hamiltonian cycles (Q2102759) (← links)
- High girth hypergraphs with unavoidable monochromatic or rainbow edges (Q2118239) (← links)
- Local boxicity (Q2122684) (← links)
- Pseudo sunflowers (Q2143417) (← links)
- Choice number of Kneser graphs (Q2166315) (← links)
- Covering metric spaces by few trees (Q2168848) (← links)
- Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
- Chain method for panchromatic colorings of hypergraphs (Q2172391) (← links)
- Bisecting and \(D\)-secting families for set systems (Q2181239) (← links)
