Name
Affiliation
Papers
ALEXANDR KOSTOCHKA
Department of Mathematics, University of Illinois, Urbana, IL and Institute of Mathematics, Novosibirsk 630090, Russia
26
Collaborators
Citations 
PageRank 
29
97
13.04
Referers 
Referees 
References 
143
143
103
Search Limit
100143
Title
Citations
PageRank
Year
On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices00.342021
Injective edge-coloring of graphs with given maximum degree10.412021
Defective DP-colorings of sparse multigraphs00.342021
Packing (1,1,2,4)-Coloring Of Subcubic Outerplanar Graphs00.342021
On-line DP-coloring of graphs00.342020
On r-uniform hypergraphs with circumference less than r10.402020
Cycles in triangle-free graphs of large chromatic number20.422017
A new tool for proving Vizing's Theorem10.342014
Ore’s conjecture for <Emphasis Type="Italic">k</Emphasis>=4 and Grötzsch’s Theorem40.492014
Large rainbow matchings in edge-coloured graphs141.022012
Dense uniform hypergraphs have high list chromatic number20.462012
A stability theorem on fractional covering of triangles by edges60.532012
Minors in graphs with high chromatic number00.342011
Hypergraph list coloring and Euclidean Ramsey theory30.562011
Hadwiger numbers and over-dominating colourings00.342010
Some constructive bounds on Ramsey numbers30.402010
Sizes of induced subgraphs of ramsey graphs20.412009
Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density20.472009
Packing d-degenerate graphs110.902008
On a graph packing conjecture by Bollobás, Eldridge and Catlin30.422008
On 2-Detour Subgraphs of the Hypercube00.342008
Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer90.692007
On Minimum Degree Implying That a Graph is H-Linked140.802006
Disjoint Kr-minors in large graphs with given average degree50.572005
Even cycles in hypergraphs10.552005
On Ramsey Numbers of Sparse Graphs130.842003