Veronica Phan

activity

20222026

collaborators

5 papers

math.CO2026

Blow-up trick in Combinatorics

Veronica Phan

Blow-up in graph theory is a procedure in which each vertex is replaced by copies of itself, and two copies are adjacent if and only if the original vertices are adjacent. In this…

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…

math.CO2022

Enhanced power graphs of groups are weakly perfect

Peter J. Cameron, Veronica Phan

A graph is weakly perfect if its clique number and chromatic number are equal. We show that the enhanced power graph of a finite group $G$ is weakly perfect: its clique number and…

Blow-up trick in Combinatorics

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

Enhanced power graphs of groups are weakly perfect

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