ThmDex – An index of mathematical definitions, results, and conjectures.
Every nonempty finite graph contains a bipartite subgraph with at least half the edges
Formulation 0
Let $G_X = (X, \mathcal{E}_X)$ be a D778: Graph such that
(i) \begin{equation} N : = |X| \in 1, 2, 3, \ldots \end{equation}
(ii) $\mathfrak{S}$ is the D5502: Set of bipartite subgraphs of $G_X$
Then \begin{equation} \left\{ G_Y = (Y, \mathcal{E}_Y) \in \mathfrak{S} : |\mathcal{E}_Y| \geq \frac{|\mathcal{E}_X|}{2} \right\} \neq \emptyset \end{equation}