Complete Minors of Self-Complementary Graphs
Andrei Pavelescu, Elena Pavelescu

TL;DR
This paper proves that self-complementary graphs with n vertices always contain a complete minor of size approximately n/2, and explores their topological properties.
Contribution
It establishes a new universal minor containment result for self-complementary graphs and analyzes their topological characteristics.
Findings
Self-complementary graphs contain a K_{floor((n+1)/2)} minor.
Derived topological properties of self-complementary graphs.
Provides insights into the structure of self-complementary graphs.
Abstract
We show that any self-complementary graph with vertices contains a minor. We derive topological properties of self-complementary graphs.
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 · Complexity and Algorithms in Graphs
