A simple proof that the edge density of Fon-der-Flaass $(3,4)$-graph is $\geq\frac{7}{16}(1-o(1))$
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915406684356608 |
|---|---|
| author | Phan, Veronica |
| author_facet | Phan, Veronica |
| contents | In 2018, Alexander A. Razborov proved that the edge density of Fon-der-Flaass $(3,4)$-graph is $\geq\frac{7}{16}(1-o(1))$, using flag algebras. In this paper, we give an elementary proof of this result. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_17666 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A simple proof that the edge density of Fon-der-Flaass $(3,4)$-graph is $\geq\frac{7}{16}(1-o(1))$ Phan, Veronica Combinatorics 90C35 In 2018, Alexander A. Razborov proved that the edge density of Fon-der-Flaass $(3,4)$-graph is $\geq\frac{7}{16}(1-o(1))$, using flag algebras. In this paper, we give an elementary proof of this result. |
| title | A simple proof that the edge density of Fon-der-Flaass $(3,4)$-graph is $\geq\frac{7}{16}(1-o(1))$ |
| topic | Combinatorics 90C35 |
| url | https://arxiv.org/abs/2507.17666 |