16 citations · 35 across the 16 of their papers we have counts for
4 papers · 1 filter
Avoidability beyond paths
Vladimir Gurvich, Matjaž Krnc, Martin Milanič +1
The concept of avoidable paths in graphs was introduced by Beisegel, Chudnovsky, Gurvich, Milanič, and Servatius in 2019 as a common generalization of avoidable vertices and simpli…
Uniform cross--intersecting families: proving Hirschorn's conjecture up to polynomial factor
Georgii P. Bulgakov, Alexander Kozachinskiy, Mikhail N. Vyalyi
We consider a problem of maximizing the product of the sizes of two uniform cross--intersecting families of sets. We show that the value of this maximum is at most polynomially…
Shifting paths to avoidable ones
Vladimir Gurvich, Matjaž Krnc, Martin Milanič +1
An extension of an induced path in a graph is an induced path such that deleting the endpoints of results in . An induced path in a graph is said to be avoidab…
Grünbaum coloring and its generalization to arbitrary dimension
S. Lawrencenko, M. N. Vyalyi, L. V. Zgonnik
This paper is a collection of thoughts and observations, being partly a review and partly a report of current research, on recent work in various aspects of Grünbaum colorings, the…