Upper bounds for linear graph codes

A linear graph code is a family $\mathcal{C}$ of graphs on $n$ vertices with the property that the symmetric difference of the edge sets of any two graphs in $\mathcal{C}$ is also the edge set of a graph in $\mathcal{C}$. In this article, we investigate the maximal size of a linear graph code that d...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Versteegen, Leo
Format: Artikel
Sprache:eng
Schlagworte:
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 Versteegen, Leo
description A linear graph code is a family $\mathcal{C}$ of graphs on $n$ vertices with the property that the symmetric difference of the edge sets of any two graphs in $\mathcal{C}$ is also the edge set of a graph in $\mathcal{C}$. In this article, we investigate the maximal size of a linear graph code that does not contain a copy of a fixed graph $H$. In particular, we show that if $H$ has an even number of edges, the size of the code is $O(2^{\binom{n}{2}}/\log n)$, making progress on a question of Alon. Furthermore, we show that for almost all graphs $H$ with an even number of edges, there exists $\varepsilon_H>0$ such that the size of a linear graph code without a copy of $H$ is at most $2^{\binom{n}{2}}/n^{\varepsilon_H}$.
doi_str_mv 10.48550/arxiv.2310.19891
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2310_19891</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2310_19891</sourcerecordid><originalsourceid>FETCH-LOGICAL-a671-cec3d13796a781e52e62a536adbcd651e44b65e8936c621211d75657be82b6053</originalsourceid><addsrcrecordid>eNotzj1vwjAQxnEvDBXwATphiTmQs3NnZ0SoL0hIXegcne0DIgGJHLVqvz2UMj3Sf3j0U-oZykXlEcsl55_2e2HsLUDta3hS88--l6xD93VJg953WZ_ai3DWh8z9UccuyTBRoz2fBpk-dqx2ry-79Xux_XjbrFfbgslBESXaBNbVxM6DoBEyjJY4hZgIQaoqEIqvLUUyYACSQ0IXxJtAJdqxmv3f3pVNn9sz59_mT9vctfYKQw44Og</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Upper bounds for linear graph codes</title><source>arXiv.org</source><creator>Versteegen, Leo</creator><creatorcontrib>Versteegen, Leo</creatorcontrib><description>A linear graph code is a family $\mathcal{C}$ of graphs on $n$ vertices with the property that the symmetric difference of the edge sets of any two graphs in $\mathcal{C}$ is also the edge set of a graph in $\mathcal{C}$. In this article, we investigate the maximal size of a linear graph code that does not contain a copy of a fixed graph $H$. In particular, we show that if $H$ has an even number of edges, the size of the code is $O(2^{\binom{n}{2}}/\log n)$, making progress on a question of Alon. Furthermore, we show that for almost all graphs $H$ with an even number of edges, there exists $\varepsilon_H&gt;0$ such that the size of a linear graph code without a copy of $H$ is at most $2^{\binom{n}{2}}/n^{\varepsilon_H}$.</description><identifier>DOI: 10.48550/arxiv.2310.19891</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2023-10</creationdate><rights>http://creativecommons.org/licenses/by-nc-nd/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/2310.19891$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2310.19891$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Versteegen, Leo</creatorcontrib><title>Upper bounds for linear graph codes</title><description>A linear graph code is a family $\mathcal{C}$ of graphs on $n$ vertices with the property that the symmetric difference of the edge sets of any two graphs in $\mathcal{C}$ is also the edge set of a graph in $\mathcal{C}$. In this article, we investigate the maximal size of a linear graph code that does not contain a copy of a fixed graph $H$. In particular, we show that if $H$ has an even number of edges, the size of the code is $O(2^{\binom{n}{2}}/\log n)$, making progress on a question of Alon. Furthermore, we show that for almost all graphs $H$ with an even number of edges, there exists $\varepsilon_H&gt;0$ such that the size of a linear graph code without a copy of $H$ is at most $2^{\binom{n}{2}}/n^{\varepsilon_H}$.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzj1vwjAQxnEvDBXwATphiTmQs3NnZ0SoL0hIXegcne0DIgGJHLVqvz2UMj3Sf3j0U-oZykXlEcsl55_2e2HsLUDta3hS88--l6xD93VJg953WZ_ai3DWh8z9UccuyTBRoz2fBpk-dqx2ry-79Xux_XjbrFfbgslBESXaBNbVxM6DoBEyjJY4hZgIQaoqEIqvLUUyYACSQ0IXxJtAJdqxmv3f3pVNn9sz59_mT9vctfYKQw44Og</recordid><startdate>20231030</startdate><enddate>20231030</enddate><creator>Versteegen, Leo</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20231030</creationdate><title>Upper bounds for linear graph codes</title><author>Versteegen, Leo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a671-cec3d13796a781e52e62a536adbcd651e44b65e8936c621211d75657be82b6053</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Versteegen, Leo</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Versteegen, Leo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Upper bounds for linear graph codes</atitle><date>2023-10-30</date><risdate>2023</risdate><abstract>A linear graph code is a family $\mathcal{C}$ of graphs on $n$ vertices with the property that the symmetric difference of the edge sets of any two graphs in $\mathcal{C}$ is also the edge set of a graph in $\mathcal{C}$. In this article, we investigate the maximal size of a linear graph code that does not contain a copy of a fixed graph $H$. In particular, we show that if $H$ has an even number of edges, the size of the code is $O(2^{\binom{n}{2}}/\log n)$, making progress on a question of Alon. Furthermore, we show that for almost all graphs $H$ with an even number of edges, there exists $\varepsilon_H&gt;0$ such that the size of a linear graph code without a copy of $H$ is at most $2^{\binom{n}{2}}/n^{\varepsilon_H}$.</abstract><doi>10.48550/arxiv.2310.19891</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2310.19891
ispartof
issn
language eng
recordid cdi_arxiv_primary_2310_19891
source arXiv.org
subjects Mathematics - Combinatorics
title Upper bounds for linear graph codes
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T07%3A08%3A22IST&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=Upper%20bounds%20for%20linear%20graph%20codes&rft.au=Versteegen,%20Leo&rft.date=2023-10-30&rft_id=info:doi/10.48550/arxiv.2310.19891&rft_dat=%3Carxiv_GOX%3E2310_19891%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