The bipartiteness conjecture for Cheeger graphs

Let $G$ be a Cheeger graph, meaning a graph attaining the first Cheeger constant of the relevant simplex. Bipartiteness conjecture. All Cheeger graphs are bipartite. This is proposed as a stronger statement than the conjecture that all Cheeger graphs are triangle-free. It is presented as an open problem.