3 papers
math.CO2026
Strong counterexamples to a supersaturation question of Ma-Yuan
Wanfang Chen, Long-Tu Yuan
For a graph , let be the minimum number of copies of in an -vertex graph with edges, where is the maximum number of edg…
quant-ph2024
Application of the Quantum Approximate Optimization Algorithm in Solving the Total Domination Problem
Haoqian Pan, Hang Yuan, Yang Liu +3
Recent advancements in quantum computing have spurred substantial research into the application of quantum algorithms to combinatorial optimization problems. Among these challenges…
math.CO2022
A stability theorem for multi-partite graphs
Wanfang Chen, Changhong Lu, Long-Tu Yuan
The Erdős-Simonovits stability theorem is one of the most widely used theorems in extremal graph theory. We obtain an Erdős-Simonovits type stability theorem in multi-partite graph…