The following pages link to Dmitriy A. Shabanov (Q314148):
Displaying 50 items.
- (Q268127) (redirect page) (← links)
- Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number (Q268128) (← links)
- On regular hypergraphs with high girth and high chromatic number (Q314149) (← links)
- Extremal problems for colorings of simple hypergraphs and applications (Q322292) (← links)
- On colorings of hypergraphs (Q369576) (← links)
- On the lower bound for the van der Waerden function (Q369596) (← links)
- Van der Waerden function and colorings of hypergraphs with large girth (Q382207) (← links)
- (Q446270) (redirect page) (← links)
- On coloring uniform hypergraphs without 3-cycles (Q446271) (← links)
- Equitable two-colorings of uniform hypergraphs (Q458597) (← links)
- On the vertex number of almost bipartite hypergraphs (Q492430) (← 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 \(r\)-chromatic hypergraphs (Q658071) (← 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 one combinatorial problem of Erdös (Q886591) (← 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)
- On the number of independent sets in simple hypergraphs (Q1646333) (← links)
- Colorings of \(b\)-simple hypergraphs (Q1689874) (← links)
- Panchromatic 3-coloring of a random hypergraph (Q1690010) (← links)
- Independence numbers of random sparse hypergraphs (Q1692740) (← links)
- Panchromatic colorings of random hypergraphs (Q1996843) (← links)
- Number of \(A + B \neq C\) solutions in abelian groups and application to counting independent sets in hypergraphs (Q2065127) (← links)
- On the maximal cut in a random hypergraph (Q2121837) (← links)
- On the strong chromatic number of random hypergraphs (Q2145753) (← links)
- Chain method for panchromatic colorings of hypergraphs (Q2172391) (← links)
- Estimating the \(r\)-colorability threshold for a random hypergraph (Q2185741) (← links)
- General independence sets in random strongly sparse hypergraphs (Q2190919) (← links)
- The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets (Q2191992) (← links)
- On the strong chromatic number of a random 3-uniform hypergraph (Q2222935) (← links)
- Random hypergraphs and property B (Q2225409) (← links)
- On the chromatic numbers of random hypergraphs (Q2243791) (← links)
- Coloring hypergraphs with bounded cardinalities of edge intersections (Q2297713) (← links)
- Equitable colorings of hypergraphs with few edges (Q2309544) (← links)
- On the weak chromatic number of random hypergraphs (Q2309562) (← 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)
- On the concentration of the chromatic number of a random hypergraph (Q2411788) (← links)
- Panchromatic 3-colorings of random hypergraphs (Q2422211) (← links)
- Choosability in simple hypergraphs (Q2445088) (← links)
- Colorings of partial Steiner systems and their applications (Q2515181) (← links)
- On-line and list on-line colorings of graphs and hypergraphs (Q2657183) (← links)
- On the \(s\)-colorful number of a random hypergraph (Q2662926) (← links)
- Equitable colorings of hypergraphs with \(r\) colors (Q2671950) (← links)
- On the concentration of the independence numbers of random hypergraphs (Q2688835) (← links)
