MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Strong games played on random graphs

Author(s)
Ferber, Asaf; Pfister, Pascal
Thumbnail
DownloadStrong games played on random graphs.pdf (358.6Kb)
PUBLISHER_POLICY

Publisher Policy

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.

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.
Metadata
Show full item record
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.
Date issued
2017-02
URI
http://hdl.handle.net/1721.1/110013
Department
Massachusetts Institute of Technology. Department of Mathematics
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
ISSN
1077-8926
1097-1440

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.