Tighter Bounds on Directed Ramsey Number R(7)

Tighter Bounds on Directed Ramsey Number R(7)

Tournaments are orientations of the complete graph, and the directed Ramsey number $R(k)$ is the minimum number of vertices a tournament must have to be guaranteed to contain a transitive subtournament of size $k$, which we denote by $TT_k$. We include a computer-assisted proof of a conjecture by Sa...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Neiman, David, Mackey, John, Heule, Marijn
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics - Combinatorics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Neiman, David
Mackey, John
Heule, Marijn
description Tournaments are orientations of the complete graph, and the directed Ramsey number $R(k)$ is the minimum number of vertices a tournament must have to be guaranteed to contain a transitive subtournament of size $k$, which we denote by $TT_k$. We include a computer-assisted proof of a conjecture by Sanchez-Flores that all $TT_6$-free tournaments on 24 and 25 vertices are subtournaments of $ST_{27}$, the unique largest TT_6-free tournament. We also classify all $TT_6$-free tournaments on 23 vertices. We use these results, combined with assistance from SAT technology, to obtain the following improved bounds: $34 \leq R(7) \leq 47$.
doi_str_mv 10.48550/arxiv.2011.00683
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2011_00683</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2011_00683</sourcerecordid><originalsourceid>FETCH-LOGICAL-a673-4d121554194c0620725aaf1efe935be1fe30921ea013cb92640ee27f77e102b23</originalsourceid><addsrcrecordid>eNotzj1vwjAUhWEvDBXwAzrVYxkS7r22YzJSPgoSohLKHjnJdYlEoHIAwb_no0xneXX0CPGOEOuRMTB04VKfYwLEGCAZqTcRZfXv9shBfh1O-6qVh72c1oHLI1dy45qWr3J9aop7sPm0g57oeLdruf_arsjms2yyiFY_38vJeBW5xKpIV0hojMZUl5AQWDLOeWTPqTIFo2cFKSE7QFUWKSUamMl6axmBClJd8fF_-_Tmf6FuXLjmD3f-dKsbUEI6pg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Tighter Bounds on Directed Ramsey Number R(7)</title><source>arXiv.org</source><creator>Neiman, David ; Mackey, John ; Heule, Marijn</creator><creatorcontrib>Neiman, David ; Mackey, John ; Heule, Marijn</creatorcontrib><description>Tournaments are orientations of the complete graph, and the directed Ramsey number $R(k)$ is the minimum number of vertices a tournament must have to be guaranteed to contain a transitive subtournament of size $k$, which we denote by $TT_k$. We include a computer-assisted proof of a conjecture by Sanchez-Flores that all $TT_6$-free tournaments on 24 and 25 vertices are subtournaments of $ST_{27}$, the unique largest TT_6-free tournament. We also classify all $TT_6$-free tournaments on 23 vertices. We use these results, combined with assistance from SAT technology, to obtain the following improved bounds: $34 \leq R(7) \leq 47$.</description><identifier>DOI: 10.48550/arxiv.2011.00683</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2020-11</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2011.00683$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2011.00683$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Neiman, David</creatorcontrib><creatorcontrib>Mackey, John</creatorcontrib><creatorcontrib>Heule, Marijn</creatorcontrib><title>Tighter Bounds on Directed Ramsey Number R(7)</title><description>Tournaments are orientations of the complete graph, and the directed Ramsey number $R(k)$ is the minimum number of vertices a tournament must have to be guaranteed to contain a transitive subtournament of size $k$, which we denote by $TT_k$. We include a computer-assisted proof of a conjecture by Sanchez-Flores that all $TT_6$-free tournaments on 24 and 25 vertices are subtournaments of $ST_{27}$, the unique largest TT_6-free tournament. We also classify all $TT_6$-free tournaments on 23 vertices. We use these results, combined with assistance from SAT technology, to obtain the following improved bounds: $34 \leq R(7) \leq 47$.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzj1vwjAUhWEvDBXwAzrVYxkS7r22YzJSPgoSohLKHjnJdYlEoHIAwb_no0xneXX0CPGOEOuRMTB04VKfYwLEGCAZqTcRZfXv9shBfh1O-6qVh72c1oHLI1dy45qWr3J9aop7sPm0g57oeLdruf_arsjms2yyiFY_38vJeBW5xKpIV0hojMZUl5AQWDLOeWTPqTIFo2cFKSE7QFUWKSUamMl6axmBClJd8fF_-_Tmf6FuXLjmD3f-dKsbUEI6pg</recordid><startdate>20201101</startdate><enddate>20201101</enddate><creator>Neiman, David</creator><creator>Mackey, John</creator><creator>Heule, Marijn</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20201101</creationdate><title>Tighter Bounds on Directed Ramsey Number R(7)</title><author>Neiman, David ; Mackey, John ; Heule, Marijn</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a673-4d121554194c0620725aaf1efe935be1fe30921ea013cb92640ee27f77e102b23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Neiman, David</creatorcontrib><creatorcontrib>Mackey, John</creatorcontrib><creatorcontrib>Heule, Marijn</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Neiman, David</au><au>Mackey, John</au><au>Heule, Marijn</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Tighter Bounds on Directed Ramsey Number R(7)</atitle><date>2020-11-01</date><risdate>2020</risdate><abstract>Tournaments are orientations of the complete graph, and the directed Ramsey number $R(k)$ is the minimum number of vertices a tournament must have to be guaranteed to contain a transitive subtournament of size $k$, which we denote by $TT_k$. We include a computer-assisted proof of a conjecture by Sanchez-Flores that all $TT_6$-free tournaments on 24 and 25 vertices are subtournaments of $ST_{27}$, the unique largest TT_6-free tournament. We also classify all $TT_6$-free tournaments on 23 vertices. We use these results, combined with assistance from SAT technology, to obtain the following improved bounds: $34 \leq R(7) \leq 47$.</abstract><doi>10.48550/arxiv.2011.00683</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2011.00683
ispartof
issn
language eng
recordid cdi_arxiv_primary_2011_00683
source arXiv.org
subjects Mathematics - Combinatorics
title Tighter Bounds on Directed Ramsey Number R(7)
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T15%3A17%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Tighter%20Bounds%20on%20Directed%20Ramsey%20Number%20R(7)&rft.au=Neiman,%20David&rft.date=2020-11-01&rft_id=info:doi/10.48550/arxiv.2011.00683&rft_dat=%3Carxiv_GOX%3E2011_00683%3C/arxiv_GOX%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