42 citations · 275 across the 72 of their papers we have counts for
14 papers · 1 filter
Defective DP-colorings of sparse multigraphs
Yifan Jing, Alexandr Kostochka, Fuhong Ma +2
DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvorak and Postle. We introduce and study -defective DP-colori…
3-Regular Graphs Are 2-Reconstructible
Alexandr V. Kostochka, Mina Nahvi, Douglas B. West +1
A graph is -reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting vertices. We prove that -regular graphs are -reconstruc…
Generalized DP-Colorings of Graphs
Alexandr V. Kostochka, Thomas Schweser, Michael Stiebitz
By a graph we mean a finite undirected graph having multiple edges but no loops. Given a graph property , a -coloring of a graph with color set is…
Extremal problems for convex geometric hypergraphs and ordered hypergraphs
Zoltán F\" uredi, Tao Jiang, Alexandr Kostochka +2
An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal probl…
Partitioning ordered hypergraphs
Zoltán F\" uredi, Tao Jiang, Alexandr Kostochka +2
An {\em ordered -graph} is an -uniform hypergraph whose vertex set is linearly ordered. Given , an ordered -graph is {\em interval} -{\em partite} if…
Monochromatic paths and cycles in -edge-colored graphs with large minimum degree
József Balogh, Alexandr Kostochka, Mikhail Lavrov +1
A graph arrows a graph if in every -edge-coloring of there exists a monochromatic copy of . Schelp had the idea that if the complete graph arrows a small gr…