On the local density problem for graphs of given odd‐girth

Erdős conjectured that every n‐vertex triangle‐free graph contains a subset of ⌊n/2⌋ vertices that spans at most n2/50 edges. Extending a recent result of Norin and Yepremyan, we confirm this conjecture for graphs homomorphic to so‐called Andrásfai graphs. As a consequence, Erdős' conjecture ho...

Full description

Saved in:
Bibliographic Details
Published in:Journal of graph theory 2019-02, Vol.90 (2), p.137-149
Main Authors: Bedenknecht, Wiebke, Mota, Guilherme Oliveira, Reiher, Christian, Schacht, Mathias
Format: Article
Language:English
Subjects:
Andrásfai graphs
Apexes
Erdõs (1/2,1/50)–conjecture
Graph theory
Graphs
sparse halves
triangle‐free graphs
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c2972-d84f8eb69a70c2f6bb3cb2ae4ea9d7ee4077583663464c634619b5f39cc4ca4d3
cites cdi_FETCH-LOGICAL-c2972-d84f8eb69a70c2f6bb3cb2ae4ea9d7ee4077583663464c634619b5f39cc4ca4d3
container_end_page 149
container_issue 2
container_start_page 137
container_title Journal of graph theory
container_volume 90
creator Bedenknecht, Wiebke
Mota, Guilherme Oliveira
Reiher, Christian
Schacht, Mathias
description Erdős conjectured that every n‐vertex triangle‐free graph contains a subset of ⌊n/2⌋ vertices that spans at most n2/50 edges. Extending a recent result of Norin and Yepremyan, we confirm this conjecture for graphs homomorphic to so‐called Andrásfai graphs. As a consequence, Erdős' conjecture holds for every triangle‐free graph G with minimum degree δ(G)>10n/29 and if χ(G)≤3 the degree condition can be relaxed to δ(G)>n/3. In fact, we obtain a more general result for graphs of higher odd‐girth.
doi_str_mv 10.1002/jgt.22372
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2148529310</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2148529310</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2972-d84f8eb69a70c2f6bb3cb2ae4ea9d7ee4077583663464c634619b5f39cc4ca4d3</originalsourceid><addsrcrecordid>eNp1kL9OwzAQhy0EEqUw8AaWmBjSnv8kjiUWVEEBVepSZstx7DRVGhc7BXXjEXhGnoSUsLLcSafv7n76ELomMCEAdLqpugmlTNATNCIgRQKE5KdoBCzjiQTKz9FFjBvoxynkI3S3bHG3trjxRje4tG2suwPeBV80doudD7gKereO2Dtc1e-2xb4svz-_qjp060t05nQT7dVfH6PXx4fV7ClZLOfPs_tFYqgUNClz7nJbZFILMNRlRcFMQbXlVstSWMtBiDRnWcZ4xs2xElmkjkljuNG8ZGN0M9ztc73tbezUxu9D279UlPA8pZIR6KnbgTLBxxisU7tQb3U4KALqKEf1ctSvnJ6dDuxH3djD_6B6ma-GjR8rZmXH</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2148529310</pqid></control><display><type>article</type><title>On the local density problem for graphs of given odd‐girth</title><source>Wiley Online Library</source><creator>Bedenknecht, Wiebke ; Mota, Guilherme Oliveira ; Reiher, Christian ; Schacht, Mathias</creator><creatorcontrib>Bedenknecht, Wiebke ; Mota, Guilherme Oliveira ; Reiher, Christian ; Schacht, Mathias</creatorcontrib><description>Erdős conjectured that every n‐vertex triangle‐free graph contains a subset of ⌊n/2⌋ vertices that spans at most n2/50 edges. Extending a recent result of Norin and Yepremyan, we confirm this conjecture for graphs homomorphic to so‐called Andrásfai graphs. As a consequence, Erdős' conjecture holds for every triangle‐free graph G with minimum degree δ(G)&gt;10n/29 and if χ(G)≤3 the degree condition can be relaxed to δ(G)&gt;n/3. In fact, we obtain a more general result for graphs of higher odd‐girth.</description><identifier>ISSN: 0364-9024</identifier><identifier>EISSN: 1097-0118</identifier><identifier>DOI: 10.1002/jgt.22372</identifier><language>eng</language><publisher>Hoboken: Wiley Subscription Services, Inc</publisher><subject>Andrásfai graphs ; Apexes ; Erdõs (1/2,1/50)–conjecture ; Graph theory ; Graphs ; sparse halves ; triangle‐free graphs</subject><ispartof>Journal of graph theory, 2019-02, Vol.90 (2), p.137-149</ispartof><rights>2018 Wiley Periodicals, Inc.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2972-d84f8eb69a70c2f6bb3cb2ae4ea9d7ee4077583663464c634619b5f39cc4ca4d3</citedby><cites>FETCH-LOGICAL-c2972-d84f8eb69a70c2f6bb3cb2ae4ea9d7ee4077583663464c634619b5f39cc4ca4d3</cites><orcidid>0000-0002-3398-3379 ; 0000-0001-9722-1819 ; 0000-0003-1762-4090</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Fjgt.22372$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Fjgt.22372$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>315,786,790,27957,27958,50923,51032</link.rule.ids></links><search><creatorcontrib>Bedenknecht, Wiebke</creatorcontrib><creatorcontrib>Mota, Guilherme Oliveira</creatorcontrib><creatorcontrib>Reiher, Christian</creatorcontrib><creatorcontrib>Schacht, Mathias</creatorcontrib><title>On the local density problem for graphs of given odd‐girth</title><title>Journal of graph theory</title><description>Erdős conjectured that every n‐vertex triangle‐free graph contains a subset of ⌊n/2⌋ vertices that spans at most n2/50 edges. Extending a recent result of Norin and Yepremyan, we confirm this conjecture for graphs homomorphic to so‐called Andrásfai graphs. As a consequence, Erdős' conjecture holds for every triangle‐free graph G with minimum degree δ(G)&gt;10n/29 and if χ(G)≤3 the degree condition can be relaxed to δ(G)&gt;n/3. In fact, we obtain a more general result for graphs of higher odd‐girth.</description><subject>Andrásfai graphs</subject><subject>Apexes</subject><subject>Erdõs (1/2,1/50)–conjecture</subject><subject>Graph theory</subject><subject>Graphs</subject><subject>sparse halves</subject><subject>triangle‐free graphs</subject><issn>0364-9024</issn><issn>1097-0118</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><recordid>eNp1kL9OwzAQhy0EEqUw8AaWmBjSnv8kjiUWVEEBVepSZstx7DRVGhc7BXXjEXhGnoSUsLLcSafv7n76ELomMCEAdLqpugmlTNATNCIgRQKE5KdoBCzjiQTKz9FFjBvoxynkI3S3bHG3trjxRje4tG2suwPeBV80doudD7gKereO2Dtc1e-2xb4svz-_qjp060t05nQT7dVfH6PXx4fV7ClZLOfPs_tFYqgUNClz7nJbZFILMNRlRcFMQbXlVstSWMtBiDRnWcZ4xs2xElmkjkljuNG8ZGN0M9ztc73tbezUxu9D279UlPA8pZIR6KnbgTLBxxisU7tQb3U4KALqKEf1ctSvnJ6dDuxH3djD_6B6ma-GjR8rZmXH</recordid><startdate>201902</startdate><enddate>201902</enddate><creator>Bedenknecht, Wiebke</creator><creator>Mota, Guilherme Oliveira</creator><creator>Reiher, Christian</creator><creator>Schacht, Mathias</creator><general>Wiley Subscription Services, Inc</general><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0002-3398-3379</orcidid><orcidid>https://orcid.org/0000-0001-9722-1819</orcidid><orcidid>https://orcid.org/0000-0003-1762-4090</orcidid></search><sort><creationdate>201902</creationdate><title>On the local density problem for graphs of given odd‐girth</title><author>Bedenknecht, Wiebke ; Mota, Guilherme Oliveira ; Reiher, Christian ; Schacht, Mathias</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2972-d84f8eb69a70c2f6bb3cb2ae4ea9d7ee4077583663464c634619b5f39cc4ca4d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Andrásfai graphs</topic><topic>Apexes</topic><topic>Erdõs (1/2,1/50)–conjecture</topic><topic>Graph theory</topic><topic>Graphs</topic><topic>sparse halves</topic><topic>triangle‐free graphs</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bedenknecht, Wiebke</creatorcontrib><creatorcontrib>Mota, Guilherme Oliveira</creatorcontrib><creatorcontrib>Reiher, Christian</creatorcontrib><creatorcontrib>Schacht, Mathias</creatorcontrib><collection>CrossRef</collection><jtitle>Journal of graph theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bedenknecht, Wiebke</au><au>Mota, Guilherme Oliveira</au><au>Reiher, Christian</au><au>Schacht, Mathias</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the local density problem for graphs of given odd‐girth</atitle><jtitle>Journal of graph theory</jtitle><date>2019-02</date><risdate>2019</risdate><volume>90</volume><issue>2</issue><spage>137</spage><epage>149</epage><pages>137-149</pages><issn>0364-9024</issn><eissn>1097-0118</eissn><notes>Contract grant sponsor: FAPESP; contract grant number: Proc. 2013/11431‐2, 2013/20733‐2; contract grant sponsor: CNPq; contract grant number: Proc. 459335/2014‐6 (to G.O.M.). Contract grant sponsor: CAPES/DAAD PROBRAL; contract grant number: Proc. 430/15; contract grant sponsor: FAPESP; contract grant number: Proc. 2013/03447‐6.</notes><abstract>Erdős conjectured that every n‐vertex triangle‐free graph contains a subset of ⌊n/2⌋ vertices that spans at most n2/50 edges. Extending a recent result of Norin and Yepremyan, we confirm this conjecture for graphs homomorphic to so‐called Andrásfai graphs. As a consequence, Erdős' conjecture holds for every triangle‐free graph G with minimum degree δ(G)&gt;10n/29 and if χ(G)≤3 the degree condition can be relaxed to δ(G)&gt;n/3. In fact, we obtain a more general result for graphs of higher odd‐girth.</abstract><cop>Hoboken</cop><pub>Wiley Subscription Services, Inc</pub><doi>10.1002/jgt.22372</doi><tpages>13</tpages><orcidid>https://orcid.org/0000-0002-3398-3379</orcidid><orcidid>https://orcid.org/0000-0001-9722-1819</orcidid><orcidid>https://orcid.org/0000-0003-1762-4090</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0364-9024
ispartof Journal of graph theory, 2019-02, Vol.90 (2), p.137-149
issn 0364-9024
1097-0118
language eng
recordid cdi_proquest_journals_2148529310
source Wiley Online Library
subjects Andrásfai graphs
Apexes
Erdõs (1/2,1/50)–conjecture
Graph theory
Graphs
sparse halves
triangle‐free graphs
title On the local density problem for graphs of given odd‐girth
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-09-21T22%3A54%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20local%20density%20problem%20for%20graphs%20of%20given%20odd%E2%80%90girth&rft.jtitle=Journal%20of%20graph%20theory&rft.au=Bedenknecht,%20Wiebke&rft.date=2019-02&rft.volume=90&rft.issue=2&rft.spage=137&rft.epage=149&rft.pages=137-149&rft.issn=0364-9024&rft.eissn=1097-0118&rft_id=info:doi/10.1002/jgt.22372&rft_dat=%3Cproquest_cross%3E2148529310%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c2972-d84f8eb69a70c2f6bb3cb2ae4ea9d7ee4077583663464c634619b5f39cc4ca4d3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2148529310&rft_id=info:pmid/&rfr_iscdi=true