8 citations · 27 across the 30 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
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 vertices and more than edges, then it contains a copy of . In 1992, Erdős, Faudree and Rousseau showed even more, that the number of edges…
math.CO2016
Optimal-size clique transversals in chordal graphs
Jacob W. Cooper, Andrzej Grzesik, Daniel Kral
The following question was raised by Tuza in 1990 and Erdos et al. in 1992: if every edge of an n-vertex chordal graph G is contained in a clique of size at least four, does G have…