Alexandr Kostochka

most citedLarge rainbow matchings in large graphs

7 citations · 7 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2015★ 1 cited

Decomposition of Sparse Graphs into Forests: The Nine Dragon Tree Conjecture for $k \leq 2$

Min Chen, Seog-Jin Kim, Alexandr Kostochka +2

For a loopless multigraph $G$ , the fractional arboricity $A r b (G)$ is the maximum of $\frac{∣ E ( H ) ∣}{∣ V ( H ) ∣ - 1}$ over all subgraphs $H$ with at least two vertices. Generalizing the Na…

math.CO2015

A list version of graph packing

Ervin Győri, Alexandr Kostochka, Andrew McConvey +1

We consider the following generalization of graph packing. Let $G_{1} = (V_{1}, E_{1})$ and $G_{2} = (V_{2}, E_{2})$ be graphs of order $n$ and $G_{3} = (V_{1} \cup V_{2}, E_{3})$ …

math.CO2014

Turan Problems and Shadows III: expansions of graphs

Alexandr Kostochka, Dhruv Mubayi, Jacques Verstraete

The expansion $G^{+}$ of a graph $G$ is the $3$ -uniform hypergraph obtained from $G$ by enlarging each edge of $G$ with a new vertex disjoint from $V (G)$ such that distinct edges are…

math.CO2012★ 7 cited

Large rainbow matchings in large graphs

Alexandr Kostochka, Florian Pfender, Matthew Yancey

A \textit{rainbow subgraph} of an edge-colored graph is a subgraph whose edges have distinct colors. The \textit{color degree} of a vertex $v$ is the number of different colors on…

math.CO2012

Harmonious Coloring of Trees with Large Maximum Degree

Saieed Akbari, Jaehoon Kim, Alexandr Kostochka

A harmonious coloring of $G$ is a proper vertex coloring of $G$ such that every pair of colors appears on at most one pair of adjacent vertices. The harmonious chromatic number of…