A simple proof that the edge density of Fon-der-Flaass $(3,4)$-graph is $\geq\frac{7}{16}(1-o(1))$

TL;DR

This paper provides an elementary proof that the edge density of Fon-der-Flaass (3,4)-graphs is at least 7/16 asymptotically, originally established using flag algebras.

Contribution

It offers a simpler, more accessible proof of a known density bound without relying on flag algebra techniques.

Findings

Edge density of Fon-der-Flaass (3,4)-graphs is at least 7/16 asymptotically

Elementary proof replaces complex flag algebra methods

Confirms the density bound with a more straightforward approach

Abstract

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.