Covering the edges of a graph with triangles
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F25%3A00604135" target="_blank" >RIV/67985807:_____/25:00604135 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1016/j.disc.2024.114226" target="_blank" >https://doi.org/10.1016/j.disc.2024.114226</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.disc.2024.114226" target="_blank" >10.1016/j.disc.2024.114226</a>
Alternative languages
Result language
angličtina
Original language name
Covering the edges of a graph with triangles
Original language description
In a graph G, let ρ△(G) denote the minimum size of a set of edges and triangles that cover all edges of G, and let α1(G) be the maximum size of an edge set that contains at most one edge from each triangle. Motivated by a question of Erdős, Gallai, and Tuza, we study the relationship between ρ△(G) and α1(G) and establish a sharp upper bound on ρ△(G). We also prove Nordhaus-Gaddum-type inequalities for the considered invariants.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Discrete Mathematics
ISSN
0012-365X
e-ISSN
1872-681X
Volume of the periodical
348
Issue of the periodical within the volume
1
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
8
Pages from-to
114226
UT code for WoS article
001307918000001
EID of the result in the Scopus database
2-s2.0-85202922453