The following pages link to Danila Cherkashin (Q446284):
Displayed 38 items.
- On hypergraph cliques with chromatic number 3 (Q446285) (← links)
- (Q656240) (redirect page) (← links)
- On two-colorings of hypergraphs (Q656242) (← links)
- A note on panchromatic colorings (Q1690224) (← links)
- Weak forms of shadowing in topological dynamics (Q1705677) (← links)
- Coloring cross-intersecting families (Q1753012) (← links)
- On the Erdős-Hajnal problem for 3-graphs (Q2027318) (← links)
- Lovász theta approach to eventown problem (Q2085430) (← links)
- On the minimal sum of edges in a signed edge-dominated graph (Q2170791) (← links)
- On small \(n\)-uniform hypergraphs with positive discrepancy (Q2338645) (← links)
- On the chromatic numbers of low-dimensional spaces (Q2358584) (← links)
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs (Q2422241) (← links)
- Regular Behavior of the Maximal Hypergraph Chromatic Number (Q3300758) (← links)
- A note on random greedy coloring of uniform hypergraphs (Q3452724) (← links)
- On the chromatic number of an infinitesimal plane layer (Q4580441) (← links)
- On the horseshoe conjecture for maximal distance minimizers (Q4646820) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- On the chromatic numbers of small-dimensional Euclidean spaces (Q5891225) (← links)
- On stability of spanning tree degree enumerators (Q6056722) (← links)
- Independence numbers of Johnson-type graphs (Q6115445) (← links)
- Erdős-Hajnal problem for \(H\)-free hypergraphs (Q6144501) (← links)
- On the chromatic number of 2-dimensional spheres (Q6151024) (← links)
- About maximal number of edges in hypergraph-clique with chromatic number 3 (Q6226496) (← links)
- About dependence of the number of edges and vertices in hypergraph clique with chromatic number 3 (Q6228242) (← links)
- A new randomized algorithm for the Erdos--Hajnal problem (Q6244430) (← links)
- Multishadowing in topological dynamics (Q6262818) (← links)
- On uniqueness in Steiner problem (Q6306282) (← links)
- On a question of Sidorenko (Q6311931) (← links)
- On the Erd{\H o}s--Hajnal problem in the case of 3-graphs (Q6318379) (← links)
- On minimizers of the maximal distance functional for a planar convex closed smooth curve (Q6354209) (← links)
- On list chromatic numbers of 2-colorable hypergraphs (Q6359873) (← links)
- Maximal distance minimizers for a rectangle (Q6369182) (← links)
- Inverse maximal and average distance minimizer problems (Q6419493) (← links)
- An overview of maximal distance minimizers problem (Q6420210) (← links)
- On small non-uniform hypergraphs without property B (Q6428657) (← links)
- Branching points in the planar Gilbert--Steiner problem have degree 3 (Q6450385) (← links)
- On stability of weighted spanning tree degree enumerators (Q6456940) (← links)
- The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000 (Q6462754) (← links)