scientific article
From MaRDI portal
Publication:4028471
zbMath0764.05043MaRDI QIDQ4028471
David Reimer, Seress, Ákos, Zoltan Fueredi
Publication date: 28 March 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
triangle-free graphsextremal graphminimum number of edgeslarge matchingtwo playersHajnal's triangle-free gamevertex valency
Extremal problems in graph theory (05C35) Games involving graphs (91A43) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (13)
Bounded degree, triangle avoidance graph games ⋮ Graph saturation games ⋮ Linear bounds for cycle-free saturation games ⋮ An upper bound on the extremal version of Hajnal's triangle-free game ⋮ Game matching number of graphs ⋮ Spanning-Tree Games. ⋮ On Hajnal's triangle-free game ⋮ On saturation games ⋮ Game saturation of intersecting families ⋮ \(\mathcal{F}\)-saturation games ⋮ Unnamed Item ⋮ Saturation games for odd cycles ⋮ Graph cover-saturation
This page was built for publication:
