AI & ChatGPT searches , social queries for ALEXANDR KOSTOCHKA
Search references for ALEXANDR KOSTOCHKA. Phrases containing ALEXANDR KOSTOCHKA
See searches and references containing ALEXANDR KOSTOCHKA!
Search references for ALEXANDR KOSTOCHKA. Phrases containing ALEXANDR KOSTOCHKA
See searches and references containing ALEXANDR KOSTOCHKA!ALEXANDR KOSTOCHKA
Russian-American mathematician
Alexandr Vasilyevich Kostochka is a mathematician who works in combinatorics and graph theory. He is a professor emeritus of mathematics at the University
Alexandr_Kostochka
Theorem in combinatorics
Maffray's characterization of the line graphs possessing kernels. Alexandr Kostochka, Borodin, and Woodall strengthened the bipartite result by allowing
Dinitz_theorem
Unproven generalization of the four-color theorem
O{\bigl (}h(G){\sqrt {\log h(G)}}{\bigr )}} colors. In the 1980s, Alexandr Kostochka and Andrew Thomason both independently proved that every graph with
Hadwiger conjecture (graph theory)
Hadwiger_conjecture_(graph_theory)
Graph coloring with equal color classes
Kostochka (2008). A polynomial time algorithm for finding equitable colorings with this many colors was described by Kierstead and Alexandr Kostochka;
Equitable_coloring
to hold for k ≤ 20 {\displaystyle k\leq 20} due to work of Alexandr Kostochka. Kostochka stated that his techniques extend to k ≤ 33 {\displaystyle k\leq
Kotzig's_conjecture
Graph coloring in which all 2-chromatic subgraphs are acyclic
Novosibirsk{{citation}}: CS1 maint: location missing publisher (link). Kostochka, Alexandr V.; Stocker, Christopher (2011), "Graphs with maximum degree 5 are
Acyclic_coloring
Subgraph with contracted edges
Theory, Series B, 102 (2): 424–435, doi:10.1016/j.jctb.2011.07.004 Kostochka, Alexandr V. (1982), "The minimum Hadwiger number for graphs with a given mean
Graph_minor
Intersection graph of convex polygons whose vertices lie on a common circle
System on Graph Classes and their Inclusions, retrieved 2016-07-11. Kostochka, Alexandr; Kratochvíl, Jan (1997), "Covering and coloring polygon-circle graphs"
Polygon-circle_graph
94 (1): 147–158. doi:10.1016/j.ejc.2007.06.020. Borodin, Oleg V.; Kostochka, Alexandr V.; Sheikh, Naeem N.; Yu, Gexin (2008). "Decomposing a planar graph
(a,_b)-decomposition
1016/j.ejc.2011.12.005, MR 3350076, S2CID 5530520 Kim, Seog-Jin; Kostochka, Alexandr; Nakprasit, Kittikorn (2004), "On the chromatic number of intersection
Chi-bounded
Generalised concept of incidence structure of polygons
programming bounds for regular graphs". arXiv:1407.4562 [math.CO]. Kostochka, Alexandr; Pudlák, Pavel; Rödl, Vojtech (2010). "Some constructive bounds on
Generalized_polygon
Collection of sets in which every two sets have the same intersection
September 2008. Retrieved 2021-12-10. Alweiss et al. (2020), p. 3. Kostochka, Alexandr V. (2000). "Extremal Problems on Δ-Systems". In Althöfer, Ingo; Cai
Sunflower_(mathematics)
ALEXANDR KOSTOCHKA
ALEXANDR KOSTOCHKA
ALEXANDR KOSTOCHKA
ALEXANDR KOSTOCHKA
ALEXANDR KOSTOCHKA
ALEXANDR KOSTOCHKA
ALEXANDR KOSTOCHKA
ALEXANDR KOSTOCHKA
ALEXANDR KOSTOCHKA