A simple proof that the edge density of Fon-der-Flaass (3,4)-graph is ≥716(1-o(1))

Abstract

In 2018, Alexander A. Razborov proved that the edge density of Fon-der-Flaass (3,4)-graph is ≥716(1-o(1)), using flag algebras. In this paper, we give an elementary proof of this result.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…