Alexandr Kostochka
Affiliations: | University of Illinois, Urbana-Champaign, Urbana-Champaign, IL |
Area:
MathematicsGoogle:
"Alexandr Kostochka"Children
Sign in to add trainee| Kittikorn Nakprasit | grad student | 2004 | UIUC |
| Gexin Yu | grad student | 2006 | UIUC |
| Naeem N. Sheikh | grad student | 2008 | UIUC |
| Jennifer Vandenbussche | grad student | 2008 | UIUC |
| Younjin Kim | grad student | 2011 | UIUC |
| Suil O | grad student | 2011 | UIUC |
| Hehui Wu | grad student | 2011 | UIUC |
| Jane V. Butterfield | grad student | 2012 | UIUC |
| William B. Kinnersley | grad student | 2012 | UIUC |
| Fang-Kai Jao | grad student | 2013 | UIUC |
| Gregory J. Puleo | grad student | 2014 | UIUC |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Füredi Z, Jiang T, Kostochka A, et al. (2021) Partitioning ordered hypergraphs Journal of Combinatorial Theory, Series A. 177: 105300 |
| Kostochka A, West DB. (2020) On reconstruction of n-vertex graphs from the multiset of (n – ℓ)-vertex induced subgraphs Ieee Transactions On Information Theory. 1-1 |
| Kostochka A, Luo R, Zirlin D. (2020) Super-pancyclic hypergraphs and bipartite graphs Journal of Combinatorial Theory, Series B. 145: 450-465 |
| Kostochka A, Xu J. (2020) On 2-defective DP-colorings of sparse graphs European Journal of Combinatorics. 103217 |
| Kim SJ, Kostochka A, Li X, et al. (2020) On-line DP-coloring of graphs Discrete Applied Mathematics. 285: 443-453 |
| Alon N, Kostochka A, Shikhelman C. (2018) Many cliques in $H$-free subgraphs of random graphs The Journal of Combinatorics. 9: 567-597 |
| Győri E, Kostochka A, McConvey A, et al. (2016) Toward Żak's conjecture on graph packing The Journal of Combinatorics. 7: 307-340 |
| Győri E, Kostochka A, McConvey A, et al. (2016) A list version of graph packing Discrete Mathematics. 339: 2178-2185 |
| Bernshteyn A, Kostochka A. (2016) On the number of edges in a graph with no ( k + 1 ) -connected subgraphs Discrete Mathematics. 339: 682-688 |
| Alon N, Kostochka A, Reiniger B, et al. (2016) Coloring, sparseness and girth Israel Journal of Mathematics. 214: 315-331 |