Covering and independence in triangle structures

P. Erdős, Tibor Gallai, Z. Tuza

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

Let G be a graph in which each edge is contained in at least one triangle (complete subgraph on three vertices). We investigate relationships between the smallest cardinality of an edge set containing at least i edges of each triangle and the largest cardinality of an edge set containing at most j edges of each triangle (i, j ∈ {1, 2}), and also compare those invariants with the numbers of vertices and edges in G. Several open problems are raised in the concluding section.

Original languageEnglish
Pages (from-to)89-101
Number of pages13
JournalDiscrete Mathematics
Volume150
Issue number1-3
Publication statusPublished - Apr 6 1996

Fingerprint

Triangle
Covering
Cardinality
Subgraph
Open Problems
Invariant
Graph in graph theory
Independence
Relationships

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Covering and independence in triangle structures. / Erdős, P.; Gallai, Tibor; Tuza, Z.

In: Discrete Mathematics, Vol. 150, No. 1-3, 06.04.1996, p. 89-101.

Research output: Contribution to journalArticle

Erdős, P. ; Gallai, Tibor ; Tuza, Z. / Covering and independence in triangle structures. In: Discrete Mathematics. 1996 ; Vol. 150, No. 1-3. pp. 89-101.
@article{7835d74a4ac3422686b93e37b50b7e31,
title = "Covering and independence in triangle structures",
abstract = "Let G be a graph in which each edge is contained in at least one triangle (complete subgraph on three vertices). We investigate relationships between the smallest cardinality of an edge set containing at least i edges of each triangle and the largest cardinality of an edge set containing at most j edges of each triangle (i, j ∈ {1, 2}), and also compare those invariants with the numbers of vertices and edges in G. Several open problems are raised in the concluding section.",
author = "P. Erdős and Tibor Gallai and Z. Tuza",
year = "1996",
month = "4",
day = "6",
language = "English",
volume = "150",
pages = "89--101",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - Covering and independence in triangle structures

AU - Erdős, P.

AU - Gallai, Tibor

AU - Tuza, Z.

PY - 1996/4/6

Y1 - 1996/4/6

N2 - Let G be a graph in which each edge is contained in at least one triangle (complete subgraph on three vertices). We investigate relationships between the smallest cardinality of an edge set containing at least i edges of each triangle and the largest cardinality of an edge set containing at most j edges of each triangle (i, j ∈ {1, 2}), and also compare those invariants with the numbers of vertices and edges in G. Several open problems are raised in the concluding section.

AB - Let G be a graph in which each edge is contained in at least one triangle (complete subgraph on three vertices). We investigate relationships between the smallest cardinality of an edge set containing at least i edges of each triangle and the largest cardinality of an edge set containing at most j edges of each triangle (i, j ∈ {1, 2}), and also compare those invariants with the numbers of vertices and edges in G. Several open problems are raised in the concluding section.

UR - http://www.scopus.com/inward/record.url?scp=0042632393&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0042632393&partnerID=8YFLogxK

M3 - Article

VL - 150

SP - 89

EP - 101

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -