Alexandr V. Kostochka

ORCID

Publication Activity (10 Years)

Years Active: 1976-2023
Publications (10 Years): 67

Top Venues

Discret. Math.

J. Graph Theory

Eur. J. Comb.

J. Comb. Theory, Ser. B

Publications

Sean English, Alexandr V. Kostochka, Dara Zirlin
Saturation for the 3-uniform loose 3-cycle. Discret. Math. 346 (11) (2023)
Alexandr V. Kostochka, Ruth Luo, Grace McCourt
Minimum degree ensuring that a hypergraph is hamiltonian-connected. Eur. J. Comb. 114 (2023)
Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
Extremal Problems for Hypergraph Blowups of Trees. SIAM J. Discret. Math. 37 (4) (2023)
Jaehoon Kim, Alexandr V. Kostochka, Suil O, Yongtang Shi, Zhiwen Wang
-saturated graphs. Discret. Math. 346 (2) (2023)
Alexandr V. Kostochka, Thomas Schweser, Michael Stiebitz
Generalized DP-colorings of graphs. Discret. Math. 346 (11) (2023)
Alexandr V. Kostochka, Ruth Luo, Songling Shan
Towards the Small Quasi-Kernel Conjecture. Electron. J. Comb. 29 (3) (2022)
Alexandr V. Kostochka, Mikhail Lavrov, Ruth Luo, Dara Zirlin
Longest cycles in 3-connected hypergraphs and bipartite graphs. J. Graph Theory 99 (4) (2022)
József Balogh, Alexandr V. Kostochka, Mikhail Lavrov, Xujun Liu
Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree. Comb. Probab. Comput. 31 (1) (2022)
József Balogh, Alexandr V. Kostochka, Mikhail Lavrov, Xujun Liu
Monochromatic connected matchings in 2-edge-colored multipartite graphs. J. Graph Theory 100 (3) (2022)
Yifan Jing, Alexandr V. Kostochka, Fuhong Ma, Jingwei Xu
Defective DP-colorings of sparse simple graphs. Discret. Math. 345 (1) (2022)
Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
Partitioning ordered hypergraphs. J. Comb. Theory, Ser. A 177 (2021)
Alexandr V. Kostochka, Xujun Liu
Packing (1, 1, 2, 4)-coloring of subcubic outerplanar graphs. Discret. Appl. Math. 302 (2021)
Yifan Jing, Alexandr V. Kostochka, Fuhong Ma, Pongpat Sittitrai, Jingwei Xu
Defective DP-colorings of sparse multigraphs. Eur. J. Comb. 93 (2021)
Alexandr V. Kostochka, Mina Nahvi, Douglas B. West, Dara Zirlin
3-regular graphs are 2-reconstructible. Eur. J. Comb. 91 (2021)
Alexandr V. Kostochka, Douglas B. West
On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices. IEEE Trans. Inf. Theory 67 (6) (2021)
Alexandr V. Kostochka, André Raspaud, Jingwei Xu
Injective edge-coloring of graphs with given maximum degree. Eur. J. Comb. 96 (2021)
Alexandr V. Kostochka, André Raspaud, Bjarne Toft, Douglas B. West, Dara Zirlin
Cut-Edges and Regular Factors in Regular Graphs of Odd Degree. Graphs Comb. 37 (1) (2021)
Alexandr V. Kostochka, Mikhail Lavrov, Ruth Luo, Dara Zirlin
Conditions for a Bigraph to be Super-Cyclic. Electron. J. Comb. 28 (1) (2021)
Alexandr V. Kostochka, Jingwei Xu
On 2-defective DP-colorings of sparse graphs. Eur. J. Comb. 91 (2021)
Alexandr V. Kostochka, Ruth Luo
On r-uniform hypergraphs with circumference less than r. Discret. Appl. Math. 276 (2020)
Alexandr V. Kostochka, Michael Stiebitz
The Minimum Number of Edges in 4-Critical Digraphs of Given Order. Graphs Comb. 36 (3) (2020)
Alexandr V. Kostochka, Ruth Luo, Dara Zirlin
Super-pancyclic hypergraphs and bipartite graphs. J. Comb. Theory, Ser. B 145 (2020)
Anton Bernshteyn, Alexandr V. Kostochka, Xuding Zhu
Fractional DP-colorings of sparse graphs. J. Graph Theory 93 (2) (2020)
Jaehoon Kim, Seog-Jin Kim, Alexandr V. Kostochka, Suil O
The minimum spectral radius of Kr+1-saturated graphs. Discret. Math. 343 (11) (2020)
Zoltán Füredi, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
Ordered and Convex Geometric Trees with Linear Extremal Function. Discret. Comput. Geom. 64 (2) (2020)
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
Berge Cycles in Non-Uniform Hypergraphs. Electron. J. Comb. 27 (3) (2020)
Seog-Jin Kim, Alexandr V. Kostochka, Xuer Li, Xuding Zhu
On-line DP-coloring of graphs. Discret. Appl. Math. 285 (2020)
Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
Hypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2. Discret. Appl. Math. 276 (2020)
Alexandr V. Kostochka, Mina Nahvi, Douglas B. West, Dara Zirlin
Degree Lists and Connectedness are 3-Reconstructible for Graphs with At Least Seven Vertices. Graphs Comb. 36 (3) (2020)
Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
Hypergraphs Not Containing a Tight Tree with a Bounded Trunk. SIAM J. Discret. Math. 33 (2) (2019)
Guantao Chen, Hein van der Holst, Alexandr V. Kostochka, Nana Li
Extremal Union-Closed Set Families. Graphs Comb. 35 (6) (2019)
Anton Bernshteyn, Alexandr V. Kostochka
DP-colorings of hypergraphs. Eur. J. Comb. 78 (2019)
Ilkyoo Choi, Ringi Kim, Alexandr V. Kostochka, Boram Park, Douglas B. West
Largest 2-Regular Subgraphs in 3-Regular Graphs. Graphs Comb. 35 (4) (2019)
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
A variation of a theorem by Pósa. Discret. Math. 342 (7) (2019)
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
Avoiding long Berge cycles. J. Comb. Theory, Ser. B 137 (2019)
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
On 2-Connected Hypergraphs with No Long Cycles. Electron. J. Comb. 26 (4) (2019)
Alexandr V. Kostochka, Xujun Liu, Roberto Assis Machado, Olgica Milenkovic
Directed Intersection Representations and the Information Content of Digraphs. ISIT (2019)
József Balogh, Alexandr V. Kostochka, Xujun Liu
Packing Chromatic Number of Subdivisions of Cubic Graphs. Graphs Comb. 35 (2) (2019)
József Balogh, Alexandr V. Kostochka, Xujun Liu
Cubic Graphs with Small Independence Ratio. Electron. J. Comb. 26 (1) (2019)
Hal A. Kierstead, Alexandr V. Kostochka, Andrew McConvey
A Sharp Dirac-Erdős Type Bound for Large Graphs. Comb. Probab. Comput. 27 (3) (2018)
József Balogh, Alexandr V. Kostochka, Xujun Liu
Packing chromatic number of cubic graphs. Discret. Math. 341 (2) (2018)
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
Extensions of a theorem of Erdős on nonhamiltonian graphs. J. Graph Theory 89 (2) (2018)
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo, Jacques Verstraëte
Stability in the Erdős-Gallai Theorem on cycles and paths, II. Discret. Math. 341 (5) (2018)
Alexandr V. Kostochka, Matthew P. Yancey
A Brooks-Type Result for Sparse Critical Graphs. Comb. 38 (4) (2018)
Samia Kerdjoudj, Alexandr V. Kostochka, André Raspaud
List star edge-coloring of subcubic graphs. Discuss. Math. Graph Theory 38 (4) (2018)
Anton Bernshteyn, Alexandr V. Kostochka
Sharp Dirac's theorem for DP-critical graphs. J. Graph Theory 88 (3) (2018)
Ilkyoo Choi, Jaehoon Kim, Alexandr V. Kostochka, André Raspaud
Strong edge-colorings of sparse graphs with large maximum degree. Eur. J. Comb. 67 (2018)
Henry A. Kierstead, Alexandr V. Kostochka, Elyse Yeager
The (2k-1)-connected multigraphs with at most k-1 disjoint cycles. Comb. 37 (1) (2017)
Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka
Tight Descriptions of 3-Paths in Normal Plane Maps : Dedicated to Andre Raspaud on the occasion of his 70th birthday. J. Graph Theory 85 (1) (2017)
Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
Turán problems and shadows II: Trees. J. Comb. Theory, Ser. B 122 (2017)
Henry A. Kierstead, Alexandr V. Kostochka, Elyse Yeager
On the Corrádi-Hajnal theorem and a question of Dirac. J. Comb. Theory, Ser. B 122 (2017)
Anton Bernshteyn, Alexandr V. Kostochka, Xuding Zhu
DP-colorings of graphs with high chromatic number. Eur. J. Comb. 65 (2017)
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
A stability version for a theorem of Erdős on nonhamiltonian graphs. Discret. Math. 340 (11) (2017)
Min Chen, Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West, Xuding Zhu
Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2. J. Comb. Theory, Ser. B 122 (2017)
Alexandr V. Kostochka, Benny Sudakov, Jacques Verstraëte
Cycles in triangle-free graphs of large chromatic number. Comb. 37 (3) (2017)
Hal A. Kierstead, Alexandr V. Kostochka, Andrew McConvey
Strengthening Theorems of Dirac and Erdős on Disjoint Cycles. J. Graph Theory 85 (4) (2017)
Anton Bernshteyn, Alexandr V. Kostochka
On the number of edges in a graph with no (k+1)-connected subgraphs. Discret. Math. 339 (2) (2016)
Zoltán Füredi, Alexandr V. Kostochka, Jacques Verstraëte
Stability in the Erdős-Gallai Theorems on cycles and paths. J. Comb. Theory, Ser. B 121 (2016)
Ervin Györi, Alexandr V. Kostochka, Andrew McConvey, Derrek Yager
A list version of graph packing. Discret. Math. 339 (8) (2016)
Jaehoon Kim, Alexandr V. Kostochka, Xuding Zhu
Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions. J. Graph Theory 81 (4) (2016)
Alexandr V. Kostochka, Xiaodong Li, Watcharintorn Ruksasakchai, Michael Santana, Tao Wang, G. Yu
Strong chromatic index of subcubic planar multigraphs. Eur. J. Comb. 51 (2016)
Alexandr V. Kostochka, Andrew McConvey, Derrek Yager
On a packing problem of Alon and Yuster. Discret. Math. 339 (11) (2016)
Alexandr V. Kostochka, Jaroslav Nesetril
Adding Edges to Increase the Chromatic Number of a Graph. Comb. Probab. Comput. 25 (4) (2016)
Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
Turán Problems and Shadows III: Expansions of Graphs. SIAM J. Discret. Math. 29 (2) (2015)
Alexandr V. Kostochka, Benjamin Reiniger
The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges. Eur. J. Comb. 46 (2015)
Hal A. Kierstead, Alexandr V. Kostochka
A refinement of a result of Corrádi and Hajnal. Comb. 35 (4) (2015)
Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
Turán problems and shadows I: Paths and cycles. J. Comb. Theory, Ser. A 129 (2015)
Zoltán Füredi, Alexandr V. Kostochka, Mohit Kumbhat
Choosability with Separation of Complete Multipartite Graphs and Hypergraphs. J. Graph Theory 76 (2) (2014)
Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka
Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11. Discret. Math. (2014)
Oleg V. Borodin, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey
Short proofs of coloring theorems on planar graphs. Eur. J. Comb. 36 (2014)
Oleg V. Borodin, Alexandr V. Kostochka
Defective 2-colorings of sparse graphs. J. Comb. Theory, Ser. B 104 (2014)
Alexandr V. Kostochka, Matthew P. Yancey
Ore's conjecture for k=4 and Grötzsch's Theorem. Comb. 34 (3) (2014)
Alexandr V. Kostochka
A new tool for proving Vizing's Theorem. Discret. Math. 326 (2014)
Alexandr V. Kostochka, Matthew P. Yancey
Ore's conjecture on color-critical graphs is almost true. J. Comb. Theory, Ser. B 109 (2014)
Oleg V. Borodin, Zdenek Dvorák, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey
Planar 4-critical graphs with four triangles. Eur. J. Comb. 41 (2014)
Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
On independent sets in hypergraphs. Random Struct. Algorithms 44 (2) (2014)
Jaehoon Kim, Alexandr V. Kostochka
Maximum hypergraphs without regular subgraphs. Discuss. Math. Graph Theory 34 (1) (2014)
Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka
Describing faces in plane triangulations. Discret. Math. 319 (2014)
Alexandr V. Kostochka
Ks, t Minors in (s+t)- Chromatic Graphs, II. J. Graph Theory 75 (4) (2014)
Jaehoon Kim, Alexandr V. Kostochka, Xuding Zhu
Improper coloring of sparse graphs with a given girth, I: (0, 1)-colorings of triangle-free graphs. Eur. J. Comb. 42 (2014)
Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West, Hehui Wu, Xuding Zhu
Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree. J. Graph Theory 74 (4) (2013)
Alexandr V. Kostochka, Matthew P. Yancey
On Coloring of Sparse Graphs. CSR (2013)
Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
Hypergraph Ramsey numbers: Triangles versus cliques. J. Comb. Theory, Ser. A 120 (7) (2013)
József Balogh, Alexandr V. Kostochka, Andrew Treglown
On Perfect Packings in Dense Graphs. Electron. J. Comb. 20 (1) (2013)
Alexandr V. Kostochka, Christopher J. Stocker, Peter Hamburger
A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge. J. Graph Theory 74 (2) (2013)
Oleg V. Borodin, Anna O. Ivanova, Tommy R. Jensen, Alexandr V. Kostochka, Matthew P. Yancey
Describing 3-paths in normal plane maps. Discret. Math. 313 (23) (2013)
József Balogh, Alexandr V. Kostochka, Andrei M. Raigorodskii
. Discuss. Math. Graph Theory 33 (1) (2013)
Hal A. Kierstead, Alexandr V. Kostochka
Equitable List Coloring of Graphs with Bounded Degree. J. Graph Theory 74 (3) (2013)
Oleg V. Borodin, Alexandr V. Kostochka, Matthew P. Yancey
On 11-improper 22-coloring of sparse graphs. Discret. Math. 313 (22) (2013)
Alexandr V. Kostochka
On almost (k-1)-degenerate (k+1)-chromatic graphs and hypergraphs. Discret. Math. 313 (4) (2013)
Oleg V. Borodin, Zdenek Dvorák, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey
Planar 4-critical graphs with four triangles. CoRR (2013)
Penny E. Haxell, Alexandr V. Kostochka, Stéphan Thomassé
A stability theorem on fractional covering of triangles by edges. Eur. J. Comb. 33 (5) (2012)
Saieed Akbari, Jaehoon Kim, Alexandr V. Kostochka
Harmonious coloring of trees with large maximum degree. Discret. Math. 312 (10) (2012)
Alexandr V. Kostochka, Matthew P. Yancey
Large Rainbow Matchings in Edge-Coloured Graphs. Comb. Probab. Comput. 21 (1-2) (2012)
Alexandr V. Kostochka, Mohit Kumbhat, Tomasz Luczak
Conflict-Free Colourings of Uniform Hypergraphs With Few Edges. Comb. Probab. Comput. 21 (4) (2012)
Penny E. Haxell, Alexandr V. Kostochka, Stéphan Thomassé
Packing and Covering Triangles in K 4-free Planar Graphs. Graphs Comb. 28 (5) (2012)
Alexandr V. Kostochka, Gexin Yu
Graphs Containing Every 2-Factor. Graphs Comb. 28 (5) (2012)
Alexandr V. Kostochka, Noah Prince
-minors in graphs with given average degree, II. Discret. Math. 312 (24) (2012)
Henry A. Kierstead, Alexandr V. Kostochka
Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring. J. Graph Theory 71 (1) (2012)
Saieed Akbari, Jaehoon Kim, Alexandr V. Kostochka
Harmonious Coloring of Trees with Large Maximum Degree CoRR (2012)

Alexandr V. Kostochka.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Alexandr V. Kostochka