On a Conjecture of Erdős, Gallai, and Tuza

DOI10.1002/jgt.21828zbMath1321.05213arXiv1311.5332OpenAlexW1565889796WikidataQ123089271 ScholiaQ123089271MaRDI QIDQ2947853

Gregory J. Puleo

Publication date: 29 September 2015

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

bipartite subgraphtriangle-free subgraphMantel's theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55)

Related Items (2)

A note on bipartite subgraphs and triangle-independent sets ⋮ extremal aspects of the Erdős-Gallai-Tuza conjecture

Cites Work

• Unnamed Item
• How to make a graph bipartite
• Density conditions for triangles in multipartite graphs
• On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs
• Covering and independence in triangle structures
• On some extremal problems in graph theory

This page was built for publication: On a Conjecture of Erdős, Gallai, and Tuza