A conjecture on triangles of graphs (Q2276982)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4193731
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A conjecture on triangles of graphs |
scientific article; zbMATH DE number 4193731 |
Statements
A conjecture on triangles of graphs (English)
0 references
1990
0 references
The author conjectured in 1981: If a grah G does not contain more than k pairwise edge-disjoint triangles, then there exists a set of at most 2k edges that meets all triangles of G. In the paper this conjecture is proved for various classes of graphs (planar graphs, graphs with n vertices and at least \((7/16)n^ 2\) edges, chordal graphs without a complete subgraph on 5 vertices). Related results for 3-uniform hypergraphs and digraphs as well as weaker and stronger versions of the conjecture for special classes of graphs are discussed. Open problems are presented.
0 references
transversal number
0 references
triangles
0 references
planar graphs
0 references
chordal graphs
0 references
3-uniform hypergraphs
0 references
digraphs
0 references
0.8803319931030273
0 references
0.8744997978210449
0 references
0.8688381910324097
0 references
0.8533298373222351
0 references
0.8319188356399536
0 references
