Jan Volec

activity

20092026

most citedMinimum number of monotone subsequences of length 4 in permutations

35 citations · 160 across the 27 of their papers we have counts for

collaborators

Showing 2016 · math.COShow all

3 papers · 2 filters

math.CO2016★ 2 cited

Densities of 3-vertex graphs

Roman Glebov, Andrzej Grzesik, Ping Hu +3

Let d_i(G) be the density of the 3-vertex i-edge graph in a graph G, i.e., the probability that three random vertices induce a subgraph with i edges. Let S be the set of all quadru…

math.CO2016

Minimum number of edges that occur in odd cycles

Andrzej Grzesik, Ping Hu, Jan Volec

If a graph has $n \geq 4 k$ vertices and more than $n^{2} /4$ edges, then it contains a copy of $C_{2 k + 1}$ . In 1992, Erdős, Faudree and Rousseau showed even more, that the number of edges…

math.CO2016

Bounded colorings of multipartite graphs and hypergraphs

Nina Kamčev, Benny Sudakov, Jan Volec

Let $c$ be an edge-coloring of the complete $n$ -vertex graph $K_{n}$ . The problem of finding properly colored and rainbow Hamilton cycles in $c$ was initiated in 1976 by Bollobás and…