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.
- An \(O(n\log n)\) algorithm for finding dissimilar strings (Q290231) (← links)
- Separation dimension of graphs and hypergraphs (Q300474) (← links)
- A new construction of non-extendable intersecting families of sets (Q311538) (← links)
- Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking (Q313805) (← links)
- Unsplittable coverings in the plane (Q317324) (← links)
- Extremal problems for colorings of simple hypergraphs and applications (Q322292) (← links)
- Equitable colorings of non-uniform simple hypergraphs (Q322355) (← links)
- Equitable colorings of nonuniform hypergraphs (Q325641) (← links)
- Van der Waerden function and colorings of hypergraphs with large girth (Q382207) (← links)
- Dimension reduction for finite trees in \(\ell_1\) (Q393734) (← links)
- Coloring 2-intersecting hypergraphs (Q396868) (← links)
- On the stability of small blocking sets (Q402943) (← links)
- Improved bounds on coloring of graphs (Q412254) (← links)
- Some new bounds on partition critical hypergraphs (Q412276) (← links)
- The adjacent vertex distinguishing total chromatic number (Q442409) (← links)
- Shearer's measure and stochastic domination of product measures (Q457089) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Equitable two-colorings of uniform hypergraphs (Q458597) (← links)
- Colouring graphs when the number of colours is almost the maximum degree (Q462929) (← links)
- A sensor-based framework for kinetic data compression (Q482331) (← links)
- Blocking sets of the classical unital (Q491986) (← links)
- On weak odd domination and graph-based quantum secret sharing (Q496043) (← links)
- An upper bound for the size of a \(k\)-uniform intersecting family with covering number \(k\) (Q501681) (← links)
- Orientations making \(k\)-cycles cyclic (Q503634) (← links)
- Hölder-type inequalities and their applications to concentration and correlation bounds (Q505059) (← links)
- Color-blind index in graphs of very low degree (Q528569) (← links)
- On the dynamic coloring of graphs (Q617650) (← links)
- Frugal, acyclic and star colourings of graphs (Q643020) (← links)
- On \(r\)-chromatic hypergraphs (Q658071) (← links)
- Polynomial treewidth forces a large grid-like-minor (Q661945) (← links)
- Relative blocking sets of unions of Baer subplanes (Q670209) (← links)
- A Kolmogorov complexity proof of the Lovász local lemma for satisfiability (Q690463) (← links)
- Dynamic chromatic number of regular graphs (Q713302) (← links)
- Invitation to intersection problems for finite sets (Q739389) (← links)
- Coloring non-uniform hypergraphs without short cycles (Q742641) (← links)
- Witness trees in the Moser-Tardos algorithmic Lovász local lemma and Penrose trees in the hard-core lattice gas (Q743431) (← links)
- Lopsided Lovász Local lemma and Latin transversals (Q753819) (← links)
- \(k\)-independent percolation on trees (Q765895) (← links)
- On the cover Ramsey number of Berge hypergraphs (Q776301) (← links)
- The hat guessing number of graphs (Q777481) (← links)
- Asymptotic behavior of the chromatic index for hypergraphs (Q805633) (← links)
- Tight multiple twins in permutations (Q825967) (← links)
- Coloring and the Lovász local lemma (Q847296) (← links)
- Sets of permutations that generate the symmetric group pairwise. (Q855853) (← links)
- Codes identifying sets of vertices in random networks (Q870971) (← links)
- Generalised acyclic edge colourings of graphs with large girth (Q879345) (← links)
- Improved algorithms for colorings of simple hypergraphs and applications (Q896005) (← links)
- Selective hypergraph colourings (Q906467) (← links)
- Unavoidable subgraphs of colored graphs (Q941378) (← links)
- An estimate for the probability of dependent events (Q956348) (← links)
