Graphs with Large Maximum Forcing Number
Published:Dec 28, 2025 03:37
•1 min read
•ArXiv
Analysis
This paper investigates the maximum forcing number of graphs, a concept related to perfect matchings. It confirms a conjecture by Liu and Zhang, providing a bound on the maximum forcing number based on the number of edges. The paper also explores the relationship between the maximum forcing number and matching switches in bipartite graphs, and investigates the minimum forcing number in specific cases. The results contribute to the understanding of graph properties related to matchings and forcing numbers.
Key Takeaways
Reference
“The paper confirms a conjecture: `F(G) ≤ n - n^2/e(G)` and explores the implications for matching switches in bipartite graphs.”