3 papers
math.CO2025
Edge version of the inducibility via the entropy method
Yichen Wang, Xiamiao Zhao, Mei Lu
The inducibility of a graph is about the maximum number of induced copies of in a graph on vertices. We consider its edge version, that is, the maximum number of induce…
math.CO2024
The Minimum Weighting Ratio Problem and Its Application in Chordal Graphs
Hui Lei, Mei Lu, Yongtang Shi +2
Constructing the maximum spanning tree of an edge-weighted connected graph is one of the important research topics in computer science and optimization, and the related res…
math.CO2024
Generalized Turán problems for a matching and long cycles
Xiamiao Zhao, Mei Lu
Let be a family of graphs. A graph is -free if does not contain any as a subgraph. The general Turán number, denoted by $ex(n,…