The following pages link to Andrei M. Raigorodskii (Q591851):
Displaying 50 items.
- (Q238275) (redirect page) (← links)
- On the measurable chromatic number of a space of dimension \(n \leq 24\) (Q265996) (← links)
- Lovász' theorem on the chromatic number of spheres revisited (Q276666) (← links)
- On large subgraphs with small chromatic numbers contained in distance graphs (Q289740) (← links)
- Defect of an admissible octahedron in a centering of an integer lattice generated by a given number of vectors (Q325642) (← links)
- Turán type results for distance graphs (Q331389) (← links)
- On chromatic numbers of nearly Kneser distance graphs (Q334403) (← links)
- New bounds for the distance Ramsey number (Q393923) (← links)
- An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges (Q403932) (← links)
- On the chromatic numbers of spheres in \(\mathbb R^n\) (Q452856) (← links)
- New bounds for the chromatic number of a space with forbidden isosceles triangles (Q471374) (← links)
- Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections (Q483655) (← links)
- Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs (Q483670) (← links)
- Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle (Q492207) (← links)
- On the chromatic number of a space with two forbidden distances (Q492399) (← links)
- 2-colorings of uniform hypergraphs (Q509176) (← links)
- On random subgraphs of Kneser graphs and their generalizations (Q512505) (← links)
- Small subgraphs in preferential attachment networks (Q526405) (← links)
- On the chromatic numbers of spheres in Euclidean spaces (Q610564) (← links)
- Counterexamples to Borsuk's conjecture on spheres of small radius (Q630237) (← links)
- On a series of problems related to the Borsuk and Nelson-Erdős-Hadwiger problems (Q635610) (← links)
- New lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^{n}\) (Q650424) (← links)
- Some analogues of the Borsuk problem in \(\mathbb Q^{n}\) (Q656238) (← links)
- On the chromatic number of a random subgraph of the Kneser graph (Q679977) (← links)
- On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces (Q745606) (← links)
- Lower bounds for the independence numbers of some distance graphs with vertices in \(\{-1,0,1\}^n\) (Q845157) (← links)
- On the independence number of distance graphs with vertices in \(\{-1,0,1\}^n\) (Q845206) (← links)
- On embedding of finite distance graphs with large chromatic number in random graphs (Q847934) (← links)
- Borsuk's problem for \((0,1)\)-polytopes and cross-polytopes (Q859218) (← links)
- On the structure of distance graphs with large chromatic numbers (Q881128) (← links)
- The problem of Borsuk, Hadwiger,and Grünbaum for some classes of polytopes and graphs (Q886453) (← links)
- On the stability of the Erdős-Ko-Rado theorem (Q889512) (← links)
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection (Q892713) (← links)
- On lower bounds for the chromatic number of sphere (Q892738) (← links)
- On Ramsey numbers for special complete distance graphs (Q942064) (← links)
- Colorings of spaces, and random graphs (Q950800) (← links)
- (Q1432247) (redirect page) (← links)
- The Borsuk problem for \((0,1)\)-polyhedra and cross polytopes. (Q1432248) (← links)
- On a bound in extremal combinatorics (Q1643771) (← links)
- (Q1690040) (redirect page) (← links)
- Modularity in several random graph models (Q1690041) (← links)
- On the stability of the independence number of a random subgraph (Q1707163) (← links)
- On the chromatic numbers of some distance graphs (Q1709876) (← links)
- On the realization of random graphs as distance graphs in spaces of fixed dimension (Q1760937) (← links)
- Distance graphs with large chromatic numbers and small clique numbers (Q1761033) (← links)
- (Q1777521) (redirect page) (← links)
- The Borsuk partition problem: the seventieth anniversary (Q1777522) (← links)
- On the Borsuk problem in \(\mathbb R^ 3\). (Q1889520) (← links)
- Chromatic numbers of spaces with forbidden monochromatic triangles (Q1947779) (← links)
- On distance subgraphs of graphs in spaces of lower dimensions (Q1948589) (← links)
