Equimatchable factor-critical graphs and independence number 2
Eduard Eiben, Michal Kotrbcik

TL;DR
This paper characterizes k-connected equimatchable factor-critical graphs with respect to their k-cuts, revealing conditions under which these graphs have independence number 2, especially for odd graphs with certain connectivity and size.
Contribution
It provides a detailed structural description of k-connected equimatchable factor-critical graphs and establishes their relation to independence number 2, extending known results for 2-connected graphs.
Findings
G-S has exactly two components with specific properties
Graphs with certain connectivity and component size have independence number 2
Characterization of when odd graphs are equimatchable and factor-critical
Abstract
A graph is equimatchable if each of its matchings is a subset of a maximum matching. It is known that any 2-connected equimatchable graph is either bipartite, or factor-critical, and that these two classes are disjoint. This paper provides a description of k-connected equimatchable factor-critical graphs with respect to their k-cuts for . As our main result we prove that if G is a k-connected equimatchable factor-critical graph with at least 2k+3 vertices and a k-cut S, then G-S has exactly two components and both these components are close to being complete or complete bipartite. If both components of G-S additionally have at least 3 vertices and , then the graph has independence number 2. On the other hand, since every 2-connected odd graph with independence number 2 is equimatchable, we get the following result. For any let G be a k-connected odd graph with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · Limits and Structures in Graph Theory
