42 citations · 275 across the 72 of their papers we have counts for
8 papers · 1 filter
Many cliques in -free subgraphs of random graphs
Noga Alon, Alexandr Kostochka, Clara Shikhelman
For two fixed graphs and let be the random variable counting the maximum number of copies of in an -free subgraph of the random graph . We s…
Strong edge-colorings of sparse graphs with large maximum degree
Ilkyoo Choi, Jaehoon Kim, Alexandr V. Kostochka +1
A {\em strong -edge-coloring} of a graph is a mapping from to such that every two adjacent edges or two edges adjacent to the same edge receive dis…
On DP-coloring of graphs and multigraphs
Anton Bernshteyn, Alexandr Kostochka, Sergei Pron
While solving a question on list coloring of planar graphs, Dvořák and Postle introduced the new notion of DP-coloring (they called it correspondence coloring). A DP-coloring of a…
Sharp Dirac's Theorem for DP-Critical Graphs
Anton Bernshteyn, Alexandr Kostochka
Correspondence coloring, or DP-coloring, is a generalization of list coloring introduced recently by Dvořák and Postle. In this paper we establish a version of Dirac's theorem on t…
A stability version for a theorem of Erdős on nonhamiltonian graphs
Zoltán Füredi, Alexandr Kostochka, Ruth Luo
Let be integers with , and set and $e(n,d):= \max\{h(n,d),h(n, \left \lfloor \frac{…
Strengthening theorems of Dirac and Erdős on disjoint cycles
Henry A. Kierstead, Alexandr V. Kostochka, Andrew McConvey
Let be an integer, be the set of vertices of degree at least in a graph , and be the set of vertices of degree at most in . In 196…