Pages that link to "Item:Q4943351"
From MaRDI portal
The following pages link to Improved bounds and algorithms for hypergraph 2-coloring (Q4943351):
Displaying 50 items.
- 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)
- Some new bounds on partition critical hypergraphs (Q412276) (← links)
- Equitable two-colorings of uniform hypergraphs (Q458597) (← links)
- On the construction of non-2-colorable uniform hypergraphs (Q476325) (← links)
- Blocking sets of the classical unital (Q491986) (← links)
- 2-colorings of uniform hypergraphs (Q509176) (← links)
- On balanced colorings of hypergraphs (Q548768) (← links)
- Lower bounds in the combinatorial problem of Erdős and Lovász (Q606577) (← links)
- Lower bounds for the number of edges in hypergraphs of certain classes (Q630232) (← links)
- Improvement of the lower bound in the Kostochka problem of panchromatic coloring of a hypergraph (Q650517) (← links)
- On two-colorings of hypergraphs (Q656242) (← links)
- On \(r\)-chromatic hypergraphs (Q658071) (← links)
- Chip games and paintability (Q726662) (← links)
- Improvement of the lower bound in the Erdös-Hajnal combinatorial problem (Q736013) (← links)
- Coloring non-uniform hypergraphs without short cycles (Q742641) (← links)
- On general two-colorings of uniform hypergraphs (Q845499) (← links)
- Improved algorithms for colorings of simple hypergraphs and applications (Q896005) (← links)
- On the chromatic number of simple triangle-free triple systems (Q1010856) (← links)
- On the chromatic number of finite systems of subsets (Q1034015) (← links)
- Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs (Q1637144) (← links)
- Colorings of \(b\)-simple hypergraphs (Q1689874) (← links)
- Majority problems of large query size (Q1720318) (← links)
- The Cayley isomorphism property for Cayley maps (Q1753007) (← links)
- Coloring cross-intersecting families (Q1753012) (← links)
- On 2-coloring certain \(k\)-uniform hypergraphs (Q1865419) (← links)
- New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\) (Q2088728) (← links)
- DP-colorings of uniform hypergraphs and splittings of Boolean hypercube into faces (Q2170789) (← links)
- Chain method for panchromatic colorings of hypergraphs (Q2172391) (← links)
- The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets (Q2191992) (← links)
- 2-colorings of hypergraphs with large girth (Q2197249) (← links)
- On colorings of 3-homogeneous hypergraphs in 3 colors (Q2206279) (← links)
- Random hypergraphs and property B (Q2225409) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- On equitable colorings of hypergraphs (Q2291188) (← links)
- Coloring hypergraphs with bounded cardinalities of edge intersections (Q2297713) (← links)
- Measurable versions of the Lovász local lemma and measurable graph colorings (Q2319876) (← links)
- Around Erdős-Lovász problem on colorings of non-uniform hypergraphs (Q2352063) (← links)
- A generalization of the Hajnal-Szemerédi theorem for uniform hypergraphs (Q2353014) (← links)
- The local cut lemma (Q2357223) (← links)
- DP-colorings of hypergraphs (Q2422217) (← links)
- Combinatorial extremum problems for 2-colorings of hypergraphs (Q2435805) (← links)
- Colorings of partial Steiner systems and their applications (Q2515181) (← links)
- On some generalizations of the property B problem of an \(n\)-uniform hypergraph (Q2671957) (← links)
- On the chromatic number of set systems (Q2748418) (← links)
- On the Problem of Erdős and Hajnal in the Case of List Colorings (Q2851493) (← links)
- (Q2857438) (← links)
- Conflict-Free Colourings of Uniform Hypergraphs With Few Edges (Q2908131) (← links)
- List Coloring with a Bounded Palette (Q2958200) (← links)
