Uniqueness for 2-Intersecting Families of Permutations and Perfect Matchings

We give a characterization of the largest $2$-intersecting families of permutations of $\{1,2,\ldots,n\}$ and of perfect matchings of the complete graph $K_{2n}$ for all $n \geq 2$.

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Chase, Gilad, Dafni, Neta, Filmus, Yuval, Lindzey, Nathan
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	Chase, Gilad Dafni, Neta Filmus, Yuval Lindzey, Nathan
description	We give a characterization of the largest $2$-intersecting families of permutations of $\{1,2,\ldots,n\}$ and of perfect matchings of the complete graph $K_{2n}$ for all $n \geq 2$.
doi_str_mv	10.48550/arxiv.2210.00245
format	Article
fullrecord	<record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2210_00245</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2210_00245</sourcerecordid><originalsourceid>FETCH-LOGICAL-a675-c5efbc42cb5f0e61c6a4828db062d41973eda185bfebe392939418c113466cb03</originalsourceid><addsrcrecordid>eNotj81KAzEURrNxIdUHcGVeYGr-m1lKsVoYqYu6Hm4yNxroZDRJRd_eaXX1weHwwSHkhrOlslqzO8jf8WspxAwYE0pfku41xc8jJiyFhilT0WxTxVzQ15je6AbGeIhY6BToC-bxWKHGKRUKaTiBMHv0Gap_n-1yRS4CHApe_--C7DcP-_VT0-0et-v7rgGz0o3XGJxXwjsdGBruDSgr7OCYEYPi7UriANxqF9ChbEUrW8Wt51wqY7xjckFu_27POf1HjiPkn_6U1Z-z5C8dRkhI</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Uniqueness for 2-Intersecting Families of Permutations and Perfect Matchings</title><source>arXiv.org</source><creator>Chase, Gilad ; Dafni, Neta ; Filmus, Yuval ; Lindzey, Nathan</creator><creatorcontrib>Chase, Gilad ; Dafni, Neta ; Filmus, Yuval ; Lindzey, Nathan</creatorcontrib><description>We give a characterization of the largest $2$-intersecting families of permutations of $\{1,2,\ldots,n\}$ and of perfect matchings of the complete graph $K_{2n}$ for all $n \geq 2$.</description><identifier>DOI: 10.48550/arxiv.2210.00245</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2022-10</creationdate><rights>http://creativecommons.org/licenses/by/4.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,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2210.00245$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2210.00245$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Chase, Gilad</creatorcontrib><creatorcontrib>Dafni, Neta</creatorcontrib><creatorcontrib>Filmus, Yuval</creatorcontrib><creatorcontrib>Lindzey, Nathan</creatorcontrib><title>Uniqueness for 2-Intersecting Families of Permutations and Perfect Matchings</title><description>We give a characterization of the largest $2$-intersecting families of permutations of $\{1,2,\ldots,n\}$ and of perfect matchings of the complete graph $K_{2n}$ for all $n \geq 2$.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj81KAzEURrNxIdUHcGVeYGr-m1lKsVoYqYu6Hm4yNxroZDRJRd_eaXX1weHwwSHkhrOlslqzO8jf8WspxAwYE0pfku41xc8jJiyFhilT0WxTxVzQ15je6AbGeIhY6BToC-bxWKHGKRUKaTiBMHv0Gap_n-1yRS4CHApe_--C7DcP-_VT0-0et-v7rgGz0o3XGJxXwjsdGBruDSgr7OCYEYPi7UriANxqF9ChbEUrW8Wt51wqY7xjckFu_27POf1HjiPkn_6U1Z-z5C8dRkhI</recordid><startdate>20221001</startdate><enddate>20221001</enddate><creator>Chase, Gilad</creator><creator>Dafni, Neta</creator><creator>Filmus, Yuval</creator><creator>Lindzey, Nathan</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20221001</creationdate><title>Uniqueness for 2-Intersecting Families of Permutations and Perfect Matchings</title><author>Chase, Gilad ; Dafni, Neta ; Filmus, Yuval ; Lindzey, Nathan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a675-c5efbc42cb5f0e61c6a4828db062d41973eda185bfebe392939418c113466cb03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Chase, Gilad</creatorcontrib><creatorcontrib>Dafni, Neta</creatorcontrib><creatorcontrib>Filmus, Yuval</creatorcontrib><creatorcontrib>Lindzey, Nathan</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Chase, Gilad</au><au>Dafni, Neta</au><au>Filmus, Yuval</au><au>Lindzey, Nathan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Uniqueness for 2-Intersecting Families of Permutations and Perfect Matchings</atitle><date>2022-10-01</date><risdate>2022</risdate><abstract>We give a characterization of the largest $2$-intersecting families of permutations of $\{1,2,\ldots,n\}$ and of perfect matchings of the complete graph $K_{2n}$ for all $n \geq 2$.</abstract><doi>10.48550/arxiv.2210.00245</doi><oa>free_for_read</oa></addata></record>
fulltext	fulltext_linktorsrc
identifier	DOI: 10.48550/arxiv.2210.00245
ispartof
issn
language	eng
recordid	cdi_arxiv_primary_2210_00245
source	arXiv.org
subjects	Mathematics - Combinatorics
title	Uniqueness for 2-Intersecting Families of Permutations and Perfect Matchings
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T01%3A46%3A11IST&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=Uniqueness%20for%202-Intersecting%20Families%20of%20Permutations%20and%20Perfect%20Matchings&rft.au=Chase,%20Gilad&rft.date=2022-10-01&rft_id=info:doi/10.48550/arxiv.2210.00245&rft_dat=%3Carxiv_GOX%3E2210_00245%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