The following pages link to Andrey B. Kupavskii (Q591850):
Displaying 50 items.
- (Q272312) (redirect page) (← links)
- On random subgraphs of Kneser and Schrijver graphs (Q272313) (← links)
- The number of double-normals in space (Q331381) (← links)
- New bounds for the distance Ramsey number (Q393923) (← links)
- (Q403944) (redirect page) (← links)
- On Schur's conjecture in \(\mathbb{R}^{4}\) (Q403945) (← links)
- A size-sensitive inequality for cross-intersecting families (Q518199) (← links)
- The chromatic number of \(\mathbb R^n\) with a set of forbidden distances (Q542347) (← links)
- On the chromatic number of with an arbitrary norm (Q626862) (← links)
- Random Kneser graphs and hypergraphs (Q668022) (← links)
- Proof of Schur's conjecture in \(\mathbb R^D\) (Q722315) (← links)
- Tilings of the plane with unit area triangles of bounded diameter (Q722368) (← links)
- Diameter graphs in \({\mathbb R}^4\) (Q741607) (← links)
- Lifting of a bound for the chromatic number of \(\mathbb R^n\) to higher dimensions (Q845498) (← links)
- On the chromatic number of simple triangle-free triple systems (Q1010856) (← links)
- Families of sets with no matchings of sizes 3 and 4 (Q1621069) (← links)
- Tilings with noncongruent triangles (Q1663799) (← links)
- Diversity of uniform intersecting families (Q1671747) (← links)
- Intersection theorems for \(\{0,\pm1\}\)-vectors and \(s\)-cross-intersecting families (Q1681899) (← links)
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors (Q1689038) (← links)
- Regular bipartite graphs and intersecting families (Q1689040) (← links)
- Families with no matchings of size \(s\) (Q1689961) (← links)
- New inequalities for families without \(k\) pairwise disjoint members (Q1747778) (← links)
- Distance graphs with large chromatic numbers and small clique numbers (Q1761033) (← links)
- Distance graphs with large chromatic number and arbitrary girth (Q1946751) (← links)
- Partition of three-dimensional sets into five parts of smaller diameter (Q1957037) (← links)
- Lower bounds for searching robots, some faulty (Q1981629) (← links)
- Sharp results concerning disjoint cross-intersecting families (Q1987086) (← links)
- Beyond the Erdős matching conjecture (Q2033940) (← links)
- On the maximum number of distinct intersections in an intersecting family (Q2075511) (← links)
- Best possible bounds on the number of distinct differences in intersecting families (Q2080226) (← links)
- Odd-distance and right-equidistant sets in the maximum and Manhattan metrics (Q2080230) (← links)
- Minimum number of partial triangulations (Q2107503) (← links)
- VC-saturated set systems (Q2143393) (← links)
- Choice number of Kneser graphs (Q2166315) (← links)
- Sharp bounds for the chromatic number of random Kneser graphs (Q2171013) (← links)
- Reconstructing the degree sequence of a sparse graph from a partial deck (Q2171022) (← links)
- The Erdős matching conjecture and concentration inequalities (Q2171025) (← links)
- Intersection theorems for triangles (Q2172651) (← links)
- The right acute angles problem? (Q2198978) (← links)
- Incompatible intersection properties (Q2300156) (← links)
- When are epsilon-nets small? (Q2304628) (← links)
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman (Q2312621) (← links)
- Degree versions of theorems on intersecting families via stability (Q2326331) (← links)
- Correction to the article: ``Intersection theorems for \((0,\pm1)\)-vectors and \(s\)-cross-intersecting families'' (Q2332800) (← links)
- Regular intersecting families (Q2334049) (← links)
- On Schur's conjecture in \(\mathbb R^4\) (Q2353708) (← links)
- Spectra of short monadic sentences about sparse random graphs (Q2358597) (← links)
- Distance Ramsey numbers (Q2375971) (← links)
- On simplices in diameter graphs in \(\mathbb{R}^4\) (Q2396420) (← links)
