A Proof of Delta Conjecture
Combinatorics
2018-06-20 v1
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.
Cite
@article{arxiv.1806.06851,
title = {A Proof of Delta Conjecture},
author = {Pedro Díaz Navarro},
journal= {arXiv preprint arXiv:1806.06851},
year = {2018}
}
Comments
12 pages, 4 figures, 1 table. arXiv admin note: substantial text overlap with arXiv:1610.00792, arXiv:1806.05562