REVIEW
Bounds for the Competition-Independence game on trees
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Bounds for the Competition-Independence game on trees
classification
math.CO
keywords
competition-independencegamelastsmovessweller-starttreesarbitrarilybounds
read the original abstract
In this paper we prove that Sweller has a strategy so that the Sweller-Start Competition-Independence game lasts at least $(5n+3)/13$ moves for every tree. Moreover, we show that there exist arbitrarily large trees such that the Sweller-Start Competition-Independence game lasts at most $(5n+26)/12$ moves, disproving a conjecture by Henning.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.