extremal aspects of the Erdős-Gallai-Tuza conjecture

DOI10.1016/J.DISC.2015.02.013zbMath1310.05125arXiv1408.5176OpenAlexW2768594358WikidataQ122950315 ScholiaQ122950315MaRDI QIDQ2342626

Gregory J. Puleo

Publication date: 29 April 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.5176

zbMATH Keywords

edge cutbipartite subgraphtriangle-free subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (1)

A note on bipartite subgraphs and triangle-independent sets

Uses Software

• MathOverflow

Cites Work

• Unnamed Item
• How to make a graph bipartite
• Covering and independence in triangle structures
• On some extremal problems in graph theory
• On a Conjecture of Erdős, Gallai, and Tuza
• A Selection of Problems and Results in Combinatorics

This page was built for publication: extremal aspects of the Erdős-Gallai-Tuza conjecture