58 citations · 220 across the 56 of their papers we have counts for
5 papers · 2 filters
On coloring of fractional powers of graphs
Stephen Hartke, Hong Liu, Šárka Petříčková
For , the fractional power $\Gmn$ of a graph is the th power of the -subdivision of , where the -subdivision is obtained by replacing each edge in w…
Extremal graphs for blow-ups of cycles and trees
Hong Liu
The \emph{blow-up} of a graph is the graph obtained from replacing each edge in by a clique of the same size where the new vertices of the cliques are all different. Erdős…
The biased odd cycle game
Asaf Ferber, Roman Glebov, Michael Krivelevich +4
In this paper we consider biased Maker-Breaker games played on the edge set of a given graph . We prove that for every and large enough , there exists a constant fo…
On the Turan number of forests
Bernard Lidický, Hong Liu, Cory Palmer
The Turan number of a graph H, ex(n,H), is the maximum number of edges in a graph on n vertices which does not have H as a subgraph. We determine the Turan number and find the uniq…
Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
József Balogh, Ping Hu, Bernard Lidický +1
In this paper we modify slightly Razborov's flag algebra machinery to be suitable for the hypercube. We use this modified method to show that the maximum number of edges of a 4-cyc…