17 papers
A stability theorem for Berge Hamiltonian cycles under a minimum degree condition
Yichen Wang, Dániel Gerbner, Xiamiao Zhao
In this paper, we study extremal and stability problems for Berge Hamiltonian cycles in -uniform hypergraphs under a minimum degree condition. Let $ g_r(n,t)=\binom{n-t}{r}+t\bi…
The maximum number of odd cycles in planar graphs forbidding shorter odd cycles
Yichen Wang, Ervin GyÅri, Zhen He
Given a graph and a family of graphs , the generalized planar Turán number is the maximum number of copies of in…
On the Turán number of blow-ups of
Xiamiao Zhao, Xin Cheng, Dániel Gerbner +4
Let denote the -uniform hypergraph on the vertex set with hyperedges . Recently, Balogh, Clemen and Lu…
Inversion diameter and treewidth
Yichen Wang, Haozhe Wang, Yuxuan Yang +1
In an oriented graph , the inversion of a subset of vertices is the operation that reverses the orientation of all arcs with both end-vertices in . The i…
Algorithm for finding vertex-edge domination number on graphs with bounded treewidth and related problems on planar graphs
Yichen Wang, Haixiang Zhang, Mei Lu
Given a graph , a vertex {\em ve-dominates} all edges incident to any vertex of . A set is a {\em ve-dominating set} if for all edges $e\…
A generalization of ErdÅs-Hajnal problem on paths with equal-degree endpoints
Xiamiao Zhao, Yichen Wang, Mei Lu
ErdÅs and Hajnal proposed a problem that: is it true that every -vertex graph with edges contains two vertices of equal degree connected by a path of length thre…