page_title: Odd cycle transversal
hierarchical_section_title: Odd cycle transversal
caption_attribution_description: English: A graph that is 2-far from being bipartite. The set of blue vertices forms an odd cycle transversal; If you remove them, the resulting graph is bipartite. sparse6=":GkA_WCiMcZ", graph6="GDr``S"
context_page_description: In graph theory, an odd cycle transversal of an undirected graph is a set of vertices of the graph that has a nonempty intersection with every odd cycle in the graph. Removing the vertices of an odd cycle transversal from a graph leaves a bipartite graph as the remaining induced subgraph.
context_section_description: In graph theory, an odd cycle transversal of an undirected graph is a set of vertices of the graph that has a nonempty intersection with every odd cycle in the graph. Removing the vertices of an odd cycle transversal from a graph leaves a bipartite graph as the remaining induced subgraph.
caption: A graph with an odd cycle transversal of size 2: removing the two blue bottom vertices leaves a bipartite graph.
exif: {}