11 citations · 32 across the 7 of their papers we have counts for
Showing 2011 · math.COShow all
2 papers · 2 filters
math.CO2011★ 2 cited
On proper colorings of hypergraphs
Nick Gravin, Dmitrii Karpov
Let be a hypergraph of maximal vertex degree , such that each its hyperedge contains at least vertices. Let . We prove that (i) The h…
math.CO2011★ 8 cited
Bounds of a number of leaves of spanning trees
Anton Bankevich, Dmitri Karpov
We prove that every connected graph with vertices of degree not 2 has a spanning tree with at least leaves. Let be a be a connected graph of girth w…