细分和近线性稳定集合

arXiv - MATH - Combinatorics Pub Date : 2024-09-14 DOI:arxiv-2409.09400

Tung Nguyen, Alex Scott, Paul Seymour

{"title":"细分和近线性稳定集合","authors":"Tung Nguyen, Alex Scott, Paul Seymour","doi":"arxiv-2409.09400","DOIUrl":null,"url":null,"abstract":"We prove that for every complete graph $K_t$, all graphs $G$ with no induced\nsubgraph isomorphic to a subdivision of $K_t$ have a stable subset of size at\nleast $|G|/{\\rm polylog}|G|$. This is close to best possible, because for $t\\ge\n6$, not all such graphs $G$ have a stable set of linear size, even if $G$ is\ntriangle-free.","PeriodicalId":501407,"journal":{"name":"arXiv - MATH - Combinatorics","volume":"18 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Subdivisions and near-linear stable sets\",\"authors\":\"Tung Nguyen, Alex Scott, Paul Seymour\",\"doi\":\"arxiv-2409.09400\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We prove that for every complete graph $K_t$, all graphs $G$ with no induced\\nsubgraph isomorphic to a subdivision of $K_t$ have a stable subset of size at\\nleast $|G|/{\\\\rm polylog}|G|$. This is close to best possible, because for $t\\\\ge\\n6$, not all such graphs $G$ have a stable set of linear size, even if $G$ is\\ntriangle-free.\",\"PeriodicalId\":501407,\"journal\":{\"name\":\"arXiv - MATH - Combinatorics\",\"volume\":\"18 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.09400\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.09400","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们证明，对于每一个完整图 $K_t$，所有没有诱导子图与 $K_t$ 的细分图同构的图 $G$，都有一个大小至少为 $|G|/{\rm polylog}|G|$ 的稳定子集。这接近于最佳可能，因为对于 $t/ge6$，并非所有这样的图 $G$ 都有线性大小的稳定子集，即使 $G$ 是无三角的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Subdivisions and near-linear stable sets

We prove that for every complete graph $K_t$, all graphs $G$ with no induced subgraph isomorphic to a subdivision of $K_t$ have a stable subset of size at least $|G|/{\rm polylog}|G|$. This is close to best possible, because for $t\ge 6$, not all such graphs $G$ have a stable set of linear size, even if $G$ is triangle-free.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

arXiv - MATH - Combinatorics

自引率

0.00%

发文量

期刊最新文献

A note on connectivity in directed graphs Proof of a conjecture on graph polytope Generalized Andrásfai--Erdős--Sós theorems for odd cycles The repetition threshold for ternary rich words Isomorphisms of bi-Cayley graphs on generalized quaternion groups