alphaFeedback
AK

Alexandr Kostochka

math.COcs.DM

On Valency

published · living versions
W_8krn7ujx·v1 · currentpublished
Turán number of three disjoint cliques of arbitrary sizes
with Dadong Peng, Zimu Xiang, Liang Zhang
1 version

Preprints & journals

93 papers in the corpus · 2005–2026
DP vertex-arboricity of sparse graphs2607.08584v2 · Peter Bradshaw, Alexandr Kostochka, Zimu Xiang2026 · 0 citationsarXiv
An introduction to equitable DP coloring of graphs2605.17783v1 · H. A. Kierstead, Alexandr Kostochka, Zimu Xiang2026 · 0 citationsarXiv
Flexible DP 3-coloring of sparse multigraphs2510.13043v1 · Peter Bradshaw, Ilkyoo Choi, Alexandr Kostochka2025 · 0 citationsarXiv
Results and Problems on Equitable Coloring of Graphs2504.14711v1 · H. A. Kierstead, Alexandr Kostochka, Zimu Xiang2025 · 0 citationsarXiv
Equitable list coloring of sparse graphs2411.08372v2 · H. A. Kierstead, Alexandr Kostochka, Zimu Xiang2024 · 0 citationsarXiv
A lower bound on the number of edges in DP-critical graphs. II. Four colors2410.01191v1 · Peter Bradshaw, Ilkyoo Choi, Alexandr Kostochka et al.2024 · 0 citationsarXiv
A lower bound on the number of edges in DP-critical graphs2409.00937v2 · Peter Bradshaw, Ilkyoo Choi, Alexandr Kostochka et al.2024 · 0 citationsarXiv
Ore-type conditions for existence of a jellyfish in a graph2404.00811v2 · Jaehoon Kim, Alexandr Kostochka, Ruth Luo2024 · 0 citationsarXiv
Sparse critical graphs for defective (1,3)(1,3)-coloring2310.08486v1 · Alexandr Kostochka, Jingwei Xu, Xuding Zhu2023 · 0 citationsarXiv
Equitable list coloring of planar graphs with given maximum degree2309.00989v2 · H. A. Kierstead, Alexandr Kostochka, Zimu Xiang2023 · 2 citationsarXiv
Acyclic graphs with at least 2ℓ+12\ell+1 vertices are ℓ\ell-recognizable2308.04509v1 · Alexandr V. Kostochka, Mina Nahvi, Douglas B. West et al.2023 · 0 citationsarXiv
Turán number for bushes2307.04932v2 · Zolt'an Furedi, Alexandr Kostochka2023 · 0 citationsarXiv
Sparse critical graphs for defective DP-colorings2306.14295v1 · Alexandr Kostochka, Jingwei Xu2023 · 1 citationarXiv
Equitable coloring of planar graphs with maximum degree at least eight2305.12041v2 · Alexandr Kostochka, Duo Lin, Zimu Xiang2023 · 6 citationsarXiv
A hypergraph analog of Dirac's Theorem for long cycles in 2-connected graphs2212.14516v3 · Alexandr Kostochka, Ruth Luo, Grace McCourt2022 · 2 citationsarXiv
On a property of 22-connected graphs and Dirac's Theorem2212.06897v2 · Alexandr Kostochka, Ruth Luo, Grace McCourt2022 · 0 citationsarXiv
Sharp lower bounds for the number of maximum matchings in bipartite multigraphs2211.10427v1 · Alexandr V. Kostochka, Douglas B. West, Zimu Xiang2022 · 1 citationarXiv
Minimum degree ensuring that a hypergraph is hamiltonian-connected2207.14794v3 · Alexandr Kostochka, Ruth Luo, Grace McCourt2022 · 1 citationarXiv
Saturation for the 33-uniform loose 33-cycle2202.07149v1 · Sean English, Alexandr Kostochka, Dara Zirlin2022 · 0 citationsarXiv
Dirac's Theorem for hamiltonian Berge cycles in uniform hypergraphs2109.12637v3 · Alexandr Kostochka, Ruth Luo, Grace McCourt2021 · 2 citationsarXiv
On sizes of 1-cross intersecting set pair systems2104.08562v1 · Alexandr V. Kostochka, Grace McCourt, Mina Nahvi2021 · 1 citationarXiv
Acyclic graphs with at least 2ℓ+12\ell+1 vertices are ℓ\ell-recognizable2103.12153v1 · Alexandr V. Kostochka, Mina Nahvi, Douglas B. West et al.2021 · 2 citationsarXiv
Injective edge-coloring of graphs with given maximum degree2010.00429v2 · Alexandr Kostochka, Andr'e Raspaud, Jingwei Xu2020 · 39 citationsarXiv
Conditions for a bigraph to be super-cyclic2006.15730v1 · Alexandr Kostochka, Mikhail Lavrov, Ruth Luo et al.2020 · 4 citationsarXiv
Defective DP-colorings of sparse simple graphs2006.10244v1 · Yifan Jing, Alexandr Kostochka, Fuhong Ma et al.2020 · 6 citationsarXiv
Kr+1K_{r+1}-saturated graphs with small spectral radius2006.04355v1 · Jaehoon Kim, Seog-Jin Kim, Alexandr V. Kostochka et al.2020 · 2 citationsarXiv
Packing (1,1,2,4)(1,1,2,4)-coloring of subcubic outerplanar graphs2005.04803v2 · Alexandr Kostochka, Xujun Liu2020 · 14 citationsarXiv
Longest cycles in 3-connected hypergraphs and bipartite graphs2004.08291v1 · Alexandr Kostochka, Mikhail Lavrov, Ruth Luo et al.2020 · 2 citationsarXiv
Extremal problems for hypergraph blowups of trees2003.00622v1 · Zolt'an Furedi, Tao Jiang, Alexandr Kostochka et al.2020 · 0 citationsarXiv
Berge cycles in non-uniform hypergraphs2002.01597v1 · Zoltan Furedi, Alexandr Kostochka, Ruth Luo2020 · 5 citationsarXiv
Towards the Small Quasi-Kernel Conjecture2001.04003v1 · Alexandr Kostochka, Ruth Luo, Songling Shan2020 · 6 citationsarXiv
Defective DP-colorings of sparse multigraphs1912.03421v1 · Yifan Jing, Alexandr Kostochka, Fuhong Ma et al.2019 · 7 citationsarXiv
3-Regular Graphs Are 2-Reconstructible1908.01258v1 · Alexandr V. Kostochka, Mina Nahvi, Douglas B. West et al.2019 · 7 citationsarXiv
Generalized DP-Colorings of Graphs1908.00282v2 · Alexandr V. Kostochka, Thomas Schweser, Michael Stiebitz2019 · 1 citationarXiv
Extremal problems for convex geometric hypergraphs and ordered hypergraphs1906.04575v1 · Zolt'an F uredi, Tao Jiang, Alexandr Kostochka et al.2019 · 10 citationsarXiv
Monochromatic paths and cycles in 22-edge-colored graphs with large minimum degree1906.02854v4 · J'ozsef Balogh, Alexandr Kostochka, Mikhail Lavrov et al.2019 · 0 citationsarXiv
Partitioning ordered hypergraphs1906.03342v2 · Zolt'an F uredi, Tao Jiang, Alexandr Kostochka et al.2019 · 0 citationsarXiv
Monochromatic connected matchings in 2-edge-colored multipartite graphs1905.04653v3 · J'ozsef Balogh, Alexandr Kostochka, Mikhail Lavrov et al.2019 · 6 citationsarXiv
Long monochromatic paths and cycles in 2-edge-colored multipartite graphs1905.04657v1 · J'ozsef Balogh, Alexandr Kostochka, Mikhail Lavrov et al.2019 · 7 citationsarXiv
Super-pancyclic hypergraphs and bipartite graphs1905.03758v1 · Alexandr Kostochka, Ruth Luo, Dara Zirlin2019 · 9 citationsarXiv
Degree lists and connectedness are 33-reconstructible for graphs with at least seven vertices1904.11901v1 · Alexandr V. Kostochka, Mina Nahvi, Douglas B. West et al.2019 · 7 citationsarXiv
Largest 2-regular subgraphs in 3-regular graphs1903.08795v1 · Ilkyoo Choi, Ringi Kim, Alexandr Kostochka et al.2019 · 2 citationsarXiv
On 2-connected hypergraphs with no long cycles1901.11159v2 · Zoltan Furedi, Alexandr Kostochka, Ruth Luo2019 · 8 citationsarXiv
Ordered and convex geometric trees with linear extremal function1812.05750v2 · Zolt'an Furedi, Alexandr Kostochka, Dhruv Mubayi et al.2018 · 10 citationsarXiv
DP-Colorings of Hypergraphs1807.08178v4 · Anton Bernshteyn, Alexandr Kostochka2018 · 12 citationsEuropean Journal of Combinatorics, 78, 2019, 134-146
Hypergraphs not containing a tight tree with a bounded trunk ~II: 3-trees with a trunk of size 21807.07057v2 · Zolt'an Furedi, Tao Jiang, Alexandr Kostochka et al.2018 · 5 citationsarXiv
Avoiding long Berge cycles II, exact bounds for all nn1807.06119v1 · Zoltan Furedi, Alexandr Kostochka, Ruth Luo2018 · 11 citationsarXiv
Extremal problems on ordered and convex geometric hypergraphs1807.05104v2 · Zolt'an Furedi, Tao Jiang, Alexandr Kostochka et al.2018 · 3 citationsarXiv
Career total: 363 works. 93 are in this corpus.Showing the 50 most recent.

Profile built from the corpus for this byline.

Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.