Doubly Biased Maker-Breaker Connectivity Game

Doubly Biased Maker-Breaker Connectivity Game

In this paper we study the (a:b) Maker-Breaker Connectivity game, played on the edge set of the complete graph on n vertices. We determine the winner for almost all values of a and b.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Electronic journal of combinatorics 2012-03, Vol.19 (1)
Hauptverfasser: Hefetz, Dan, Mikalački, Mirjana, Stojaković, Miloš
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue 1
container_start_page
container_title The Electronic journal of combinatorics
container_volume 19
creator Hefetz, Dan
Mikalački, Mirjana
Stojaković, Miloš
description In this paper we study the (a:b) Maker-Breaker Connectivity game, played on the edge set of the complete graph on n vertices. We determine the winner for almost all values of a and b.
doi_str_mv 10.37236/2129
format Article
fullrecord <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_37236_2129</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_37236_2129</sourcerecordid><originalsourceid>FETCH-LOGICAL-c221t-4ee83d1f6e3d69057190410d4f477e5f74ab9a25693bfa247c568efa1084d19e3</originalsourceid><addsrcrecordid>eNpNjztPwzAURq0KpJbS_5CF0XCvn_FIAxSkIpZ2jpz4WkpfQXZAyr-HAgPT-YZPRzqMLRBupRXS3AkUbsJmCNby0glz8W9P2VXOO4Dvi9Mzxh_6j-YwFsvOZwrFq99T4stEZxZVfzpRO3Sf3TAWK3-ka3YZ_SHT4o9ztn163FTPfP22eqnu17wVAgeuiEoZMBqSwTjQFh0ohKCispZ0tMo3zgttnGyiF8q22pQUPUKpAjqSc3bz621Tn3OiWL-n7ujTWCPUP431uVF-AXUuQV4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Doubly Biased Maker-Breaker Connectivity Game</title><source>EZB-FREE-00999 freely available EZB journals</source><creator>Hefetz, Dan ; Mikalački, Mirjana ; Stojaković, Miloš</creator><creatorcontrib>Hefetz, Dan ; Mikalački, Mirjana ; Stojaković, Miloš</creatorcontrib><description>In this paper we study the (a:b) Maker-Breaker Connectivity game, played on the edge set of the complete graph on n vertices. We determine the winner for almost all values of a and b.</description><identifier>ISSN: 1077-8926</identifier><identifier>EISSN: 1077-8926</identifier><identifier>DOI: 10.37236/2129</identifier><language>eng</language><ispartof>The Electronic journal of combinatorics, 2012-03, Vol.19 (1)</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c221t-4ee83d1f6e3d69057190410d4f477e5f74ab9a25693bfa247c568efa1084d19e3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Hefetz, Dan</creatorcontrib><creatorcontrib>Mikalački, Mirjana</creatorcontrib><creatorcontrib>Stojaković, Miloš</creatorcontrib><title>Doubly Biased Maker-Breaker Connectivity Game</title><title>The Electronic journal of combinatorics</title><description>In this paper we study the (a:b) Maker-Breaker Connectivity game, played on the edge set of the complete graph on n vertices. We determine the winner for almost all values of a and b.</description><issn>1077-8926</issn><issn>1077-8926</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNpNjztPwzAURq0KpJbS_5CF0XCvn_FIAxSkIpZ2jpz4WkpfQXZAyr-HAgPT-YZPRzqMLRBupRXS3AkUbsJmCNby0glz8W9P2VXOO4Dvi9Mzxh_6j-YwFsvOZwrFq99T4stEZxZVfzpRO3Sf3TAWK3-ka3YZ_SHT4o9ztn163FTPfP22eqnu17wVAgeuiEoZMBqSwTjQFh0ohKCispZ0tMo3zgttnGyiF8q22pQUPUKpAjqSc3bz621Tn3OiWL-n7ujTWCPUP431uVF-AXUuQV4</recordid><startdate>20120331</startdate><enddate>20120331</enddate><creator>Hefetz, Dan</creator><creator>Mikalački, Mirjana</creator><creator>Stojaković, Miloš</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20120331</creationdate><title>Doubly Biased Maker-Breaker Connectivity Game</title><author>Hefetz, Dan ; Mikalački, Mirjana ; Stojaković, Miloš</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c221t-4ee83d1f6e3d69057190410d4f477e5f74ab9a25693bfa247c568efa1084d19e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hefetz, Dan</creatorcontrib><creatorcontrib>Mikalački, Mirjana</creatorcontrib><creatorcontrib>Stojaković, Miloš</creatorcontrib><collection>CrossRef</collection><jtitle>The Electronic journal of combinatorics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hefetz, Dan</au><au>Mikalački, Mirjana</au><au>Stojaković, Miloš</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Doubly Biased Maker-Breaker Connectivity Game</atitle><jtitle>The Electronic journal of combinatorics</jtitle><date>2012-03-31</date><risdate>2012</risdate><volume>19</volume><issue>1</issue><issn>1077-8926</issn><eissn>1077-8926</eissn><abstract>In this paper we study the (a:b) Maker-Breaker Connectivity game, played on the edge set of the complete graph on n vertices. We determine the winner for almost all values of a and b.</abstract><doi>10.37236/2129</doi></addata></record>
fulltext fulltext
identifier ISSN: 1077-8926
ispartof The Electronic journal of combinatorics, 2012-03, Vol.19 (1)
issn 1077-8926
1077-8926
language eng
recordid cdi_crossref_primary_10_37236_2129
source EZB-FREE-00999 freely available EZB journals
title Doubly Biased Maker-Breaker Connectivity Game
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T12%3A00%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Doubly%20Biased%20Maker-Breaker%20Connectivity%20Game&rft.jtitle=The%20Electronic%20journal%20of%20combinatorics&rft.au=Hefetz,%20Dan&rft.date=2012-03-31&rft.volume=19&rft.issue=1&rft.issn=1077-8926&rft.eissn=1077-8926&rft_id=info:doi/10.37236/2129&rft_dat=%3Ccrossref%3E10_37236_2129%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true