Veronica Phan

activity

20222025

collaborators

3 papers

math.CO2025

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

Veronica Phan

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…

math.CO2024

Entropy approach for a generalization of Frankl's conjecture

Veronica Phan

In this paper, we will use the entropy approach to derive a necessary and sufficient condition for the existence of an element that belongs to at least half of the sets in a finite…

math.CO2022

Quasiperfect graph

Veronica Phan

A perfect graph is a graph which every induced subgraph has clique number equal to chromatic number. In this paper, I will introduce a new family of graphs, the quasiperfect graphs…

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

Entropy approach for a generalization of Frankl's conjecture

Quasiperfect graph

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