Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On Hajnal's triangle-free game

From MaRDI portal
Publication:1187952
Jump to:navigation, search

DOI10.1007/BF01271710zbMath0757.90096MaRDI QIDQ1187952

Seress, Ákos

Publication date: 3 August 1992

Published in: Graphs and Combinatorics (Search for Journal in Brave)


zbMATH Keywords

Hajnal's triangle-free game


Mathematics Subject Classification ID

Games involving graphs (91A43) Graph theory (05C99)


Related Items (9)

Bounded degree, triangle avoidance graph games ⋮ Maximal triangle‐free graphs with restrictions on the degrees ⋮ On maximal triangle‐free graphs ⋮ Impartial hypergraph games ⋮ A connected version of the graph coloring game ⋮ An upper bound on the extremal version of Hajnal's triangle-free game ⋮ Game matching number of graphs ⋮ Game saturation of intersecting families ⋮ Intersecting designs from linear programming and graphs of diameter two




Cites Work

  • Maximal triangle‐free graphs with restrictions on the degrees
  • Unnamed Item




This page was built for publication: On Hajnal's triangle-free game

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1187952&oldid=12060036"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 00:19.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki