# The Erd\H{o}s bipartification conjecture is true in the special case of Andr\'asfai graphs

## TL;DR

This paper proves that for Andr\'asfai graphs, a minimal bipartification set of edges exists with size proportional to the square of the number of vertices, supporting Erd\

## Contribution

It establishes a specific minimal bipartification for Andr\'asfai graphs, providing a concrete edge set size that aligns with Erd\

## Key findings

- The minimal bipartification set has exactly loor(k^2/4) edges.
- The size of the bipartification set is proportional to the square of the number of vertices.
- Results support Erd\

## Abstract

Let the Andr\'{a}sfai graph $\mathrm{And}_k$ be defined as the graph with vertex set $\{v_0,v_1,...c, v_{3k-2}\}$ and two vertices $v_i$ and $v_j$ being adjacent iff $|i-j| \equiv 1\mod 3$. The graphs $\mathrm{And}_k$ are maximal triangle-free and play a role in characterizing triangle-free graphs with large minimum degree as homomorphic preimages. A minimal bipartification of a graph $G$ is defined as a set of edges $F\subset E(G)$ having the property that the graph $(V(G), E(G)\backslash F)$ is bipartite and for every $e \in F$ the graph $(V(G), E(G)\backslash (F\backslash e))$ is not bipartite. In this note it is shown that there is a minimal bipartification $F_k$ of $\mathrm{And}_k$ which consists of exactly $\lfloor\frac{k^2}{4}\rfloor$ edges. This equals $\lfloor{1/36}\bigl(|\mathrm{And}_k|+1\bigr)^2\rfloor$, where $|\cdot|$ denotes the number of vertices of a graph. For all $k$ this is consistent with a conjecture of Paul Erd\H{o}s that every triangle-free graph $G$ can be made bipartite by deleting at most ${1/25} |G|^2$ edges. Bipartifications like $F_k$ may be useful for proving that arbitrary homomorphic preimages of an Andr\'{a}sfai graph can be made bipartite by deleting at most ${1/25} |G|^2$ edges.