Abstract
ABSTRACTA linear graph code is a family of graphs on vertices with the property that the symmetric difference of the edge sets of any two graphs in is also the edge set of a graph in . In this article, we investigate the maximal size of a linear graph code that does not contain a copy of a fixed graph . In particular, we show that if has an even number of edges, the size of the code is , making progress on a question of Alon. Furthermore, we show that for almost all graphs with an even number of edges, there exists such that the size of a linear graph code without a copy of is at most .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
