Covering and independence in triangle structures

DOI10.1016/0012-365X(95)00178-YzbMath0857.05077WikidataQ105719850 ScholiaQ105719850MaRDI QIDQ1916100

Zsolt Tuza, Paul Erdős, Tibor Gallai

Publication date: 26 February 1997

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

zbMATH Keywords

triangleindependencecoveringtriangular graph

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

A note on bipartite subgraphs and triangle-independent sets, Small edge sets meeting all triangles of a graph, Graphs with \(\alpha _1\) and \(\tau _1\) both large, On a Conjecture of Erdős, Gallai, and Tuza, Triangle packing and covering in dense random graphs, Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number, extremal aspects of the Erdős-Gallai-Tuza conjecture

Cites Work

• Unnamed Item
• Clique-transversal sets of line graphs and complements of line graphs
• A note on Ramsey numbers
• Triangle-free partial graphs and edge covering theorems
• Covering all cliques of a graph
• Extensions of Gallai's graph covering theorems for uniform hypergraphs
• Covering the cliques of a graph with vertices
• The minimum number of triangles covering the edges of a graph
• Graph Theory and Probability. II