A conjecture on triangles of graphs (Q2276982): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On rigid circuit graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5203068 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Triangle-free partial graphs and edge covering theorems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Upper bound for transversals of tripartite hypergraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3798697 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Helly-type hypergraphs and Sperner families / rank | |||
Normal rank | |||
Latest revision as of 14:31, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A conjecture on triangles of graphs |
scientific article |
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
