Max Cuts in Triangle-Free Graphs

  title={Max Cuts in Triangle-Free Graphs},
  author={J{\'o}zsef Balogh and Felix Christian Clemen and Bernard Lidick'y},
A well-known conjecture by Erdős states that every trianglefree graph on n vertices can be made bipartite by removing at most n/25 edges. This conjecture was known for graphs with edge density at least 0.4 and edge density at most 0.172. Here, we will extend the edge density for which this conjecture is true; we prove the conjecture for graphs with edge density at most 0.2486 and for graphs with edge density at least 0.3197. Further, we prove that every triangle-free graph can be made bipartite… 

More about sparse halves in triangle-free graphs

One of Erdős’s conjectures states that every triangle-free graph on vertices has an induced subgraph on vertices with at most edges. We report several partial results towards this conjecture. In

10 Problems for Partitions of Triangle-free Graphs

We will state 10 problems, and solve some of them, for partitions in triangle-free graphs related to Erd˝os’ Sparse Half Conjecture. Among others we prove the following variant of it: For every

The Spectrum of Triangle-free Graphs

Denote by q n ( G ) the smallest eigenvalue of the signless Laplacian matrix of an n -vertex graph G . Brandt conjectured in 1997 that for regular triangle-free graphs q n ( G ) ≤ 4 n 25 . We prove a



On the Edge Distribution in Triangle-free Graphs

Two problems on the edge distribution in triangle-free graphs are considered: (1) Given an 0 < ? < 1. Find the largest s = s(?) such that for infinitely many n there exists a triangle-free graph G on

Note making a K4-free graph bipartite

It is shown that every K4-free graph G with n vertices can be made bipartite by deleting at most n2/9 edges, which proves an old conjecture of P. Erdős.

Making Kr+1-free graphs r-partite

Füredi gave a short proof that one can choose α = ε and a bound for the relationship of α and ε which is asymptotically sharp as ε → 0.

ODD Cycles of Specified Length in Non-Bipartite Graphs

Exact stability for Turán’s Theorem

Turán's Theorem says that an extremal Kr+1-free graph is r-partite. The Stability Theorem of Erdős and Simonovits shows that if a Kr+1-free graph with n vertices has close to the maximal tr(n) edges,

How to make a graph bipartite

Triangle-independent sets vs. cuts

A set of edges $T$ in a graph $G$ is triangle-independent if $T$ contains at most one edge from each triangle in $G$. Let $\alpha_1(G)$ denote the maximum size of the triangle-independent set in $G$,

Problems and Results in Graph Theory and Combinatorial Analysis

I published several papers with similar titles. One of my latest ones [13] (also see [16] and the yearly meetings at Boca Raton or Baton Rouge) contains, in the introduction, many references to my

Flag algebras

The first application of a formal calculus that captures many standard arguments in the area of asymptotic extremal combinatorics is given by presenting a new simple proof of a result by Fisher about the minimal possible density of triangles in a graph with given edge density.

Some old and new problems in various branches of combinatorics