
TL;DR
This paper proves the delta conjecture by constructing orthogonal representations for specific classes of graphs, extending the approach to more complex graph structures, and establishing the conjecture's validity.
Contribution
It introduces a method to prove the delta conjecture using orthogonal representations for $ ext{delta}$-graphs and their extensions, providing a new proof for the conjecture.
Findings
Delta graphs satisfy the delta conjecture.
Orthogonal representations exist for extended graph classes.
The proof applies to graphs of the form $ar{P_{ ext{delta}+2} old G}$.
Abstract
By finding orthogonal representation for a family of simple connected called -graphs it is possible to show that -graphs satisfy delta conjecture. An extension of the argument to graphs of the form where is a path and is a simple connected graph it is possible to find an orthogonal representation of in . As a consequence we prove delta conjecture.
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 theory and applications · graph theory and CDMA systems
