5 citations · 12 across the 5 of their papers we have counts for
5 papers · 1 filter
Integer colorings with no rainbow -term arithmetic progression
Hao Lin, Guanghui Wang, Wenling Zhou
In this paper, we study the rainbow Erdős-Rothschild problem with respect to -term arithmetic progressions. For a set of positive integers , an -coloring of…
Integer colorings with no rainbow 3-term arithmetic progression
Xihe Li, Hajo Broersma, Ligong Wang
In this paper, we study the rainbow Erdős-Rothschild problem with respect to 3-term arithmetic progressions. We obtain the asymptotic number of -colorings of without rainb…
Locating any two vertices on Hamiltonian cycles
Weihua He, Hao Li, Qiang Sun
In this paper we give a proof of Enomoto's conjecture for graphs of sufficiently large order. Enomoto's conjecture states that, if is a graph of order with minimum degree $…
A new type of Ramsey-Turan problems
Hao Li, Vladimir Nikiforov, Richard Schelp
We introduce and study a new type of Ramsey-Turan problems, a typical example of which is the following one: let c>0 and G be a graph of sufficiently large order n with minimum deg…
Best lower bound for the maximum heterochromatic matchings in edge-colored bipartite graphs
Lin Hu, Hao Li, Xueliang Li
This paper has been withdrawn by the author(s), due an error in the proof.