Strong games played on random graphs
Name
Strong games played on random graphs.pdf
Size
358.66 KB
Format
Adobe PDF
Checksum (MD5)
d93fae9cd531294a033ffde84d4a3c46
Author(s)
Ferber, Asaf
Pfister, Pascal
Date Issued
February 2017
Journal
Electronic Journal of Combinatorics
Publisher
European Mathematical Information Service (EMIS)
Citation
Ferber, Asaf and Pascal Pfister. "Strong games played on random graphs." The Electronic Journal of Combinatorics 24.1 (2017): n. pag.
Version
Final published version
Abstract
In a strong game played on the edge set of a graph G there are two players, Red and Blue, alternating turns in claiming previously unclaimed edges of G (with Red playing first). The winner is the first one to claim all the edges of some target structure (such as a clique K[subscript k], a perfect matching, a Hamilton cycle, etc.). In this paper we consider strong games played on the edge set of a random graph G ∼ G(n, p) on n vertices. We prove that G ∼ G(n, p) is typically such that Red
can win the perfect matching game played on E(G), provided that p ∈ (0, 1) is a fixed constant.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i1p35/pdf
