4 papers
Turán-type and tiling problems in oriented graphs
Ming Chen, Wenxu Lu, Yun Wang +1
Given , let be the tournament on vertices obtained by replacing the vertices of the directed triangle with transitive tournaments $TT_a…
Ore-type condition for antidirected Hamilton cycles in oriented graphs
Junqing Cai, Guanghui Wang, Yun Wang +1
An antidirected cycle in a digraph is a subdigraph whose underlying graph is a cycle, and in which no two consecutive edges form a directed path in . Let be the…
Arbitrary orientations of cycles in oriented graphs
Guanghui Wang, Yun Wang, Zhiwei Zhang
We show that every sufficiently large oriented graph with minimum indegree and outdegree both at least contains every orientation of a Hamilton cycle. This resu…
A Sampling-based Framework for Hypothesis Testing on Large Attributed Graphs
Yun Wang, Chrysanthi Kosyfaki, Sihem Amer-Yahia +1
Hypothesis testing is a statistical method used to draw conclusions about populations from sample data, typically represented in tables. With the prevalence of graph representation…