3 papers
math.CO2026
Covering powers of cycles with equivalence subgraphs
Zhanping Yang
Let denote the th power of the cycle . The equivalence covering number , studied by Alon, is the minimum number of equivalence subgraphs neede…
math.CO2026
Intersections of Directed Graphs
Zhanping Yang, Qinghou Zeng
Given two weighted directed graphs of order \(n\), we study how much their overlap can deviate from its random average under relabelling, and how concentrated the distribution of t…
math.CO2026
Intersections of Oriented Graphs and Tournaments
Zhanping Yang, Qinghou Zeng
Given two tournaments of order , Bollobás and Scott defined their discrepancy as the largest deviation of their overlap from its random average under relabelling, and they asked…