Pub Date : 2025-05-01Epub Date: 2025-01-24DOI: 10.1016/j.jctb.2025.01.002
Mikhail Isaev , Brendan D. McKay , Rui-Ray Zhang
An Eulerian orientation is an orientation of the edges of a graph such that every vertex is balanced: its in-degree equals its out-degree. Counting Eulerian orientations corresponds to the crucial partition function in so-called “ice-type models” in statistical physics and is known to be hard for general graphs. For all graphs with good expansion properties and degrees larger than , we derive an asymptotic expansion for this count that approximates it to precision for arbitrarily large c, where n is the number of vertices. The proof relies on a new tail bound for the cumulant expansion of the Laplace transform, which is of independent interest.
{"title":"Cumulant expansion for counting Eulerian orientations","authors":"Mikhail Isaev , Brendan D. McKay , Rui-Ray Zhang","doi":"10.1016/j.jctb.2025.01.002","DOIUrl":"10.1016/j.jctb.2025.01.002","url":null,"abstract":"<div><div>An Eulerian orientation is an orientation of the edges of a graph such that every vertex is balanced: its in-degree equals its out-degree. Counting Eulerian orientations corresponds to the crucial partition function in so-called “ice-type models” in statistical physics and is known to be hard for general graphs. For all graphs with good expansion properties and degrees larger than <span><math><msup><mrow><mi>log</mi></mrow><mrow><mn>8</mn></mrow></msup><mo></mo><mi>n</mi></math></span>, we derive an asymptotic expansion for this count that approximates it to precision <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mo>−</mo><mi>c</mi></mrow></msup><mo>)</mo></math></span> for arbitrarily large <em>c</em>, where <em>n</em> is the number of vertices. The proof relies on a new tail bound for the cumulant expansion of the Laplace transform, which is of independent interest.</div></div>","PeriodicalId":54865,"journal":{"name":"Journal of Combinatorial Theory Series B","volume":"172 ","pages":"Pages 263-314"},"PeriodicalIF":1.2,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143092871","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-05-01Epub Date: 2025-01-13DOI: 10.1016/j.jctb.2024.12.009
Zach Hunter , Aleksa Milojević , Benny Sudakov , István Tomon
The celebrated Kővári-Sós-Turán theorem states that any n-vertex graph containing no copy of the complete bipartite graph has at most edges. In the past two decades, motivated by the applications in discrete geometry and structural graph theory, a number of results demonstrated that this bound can be greatly improved if the graph satisfies certain structural restrictions. We propose the systematic study of this phenomenon, and state the conjecture that if H is a bipartite graph, then an induced H-free and -free graph cannot have much more edges than an H-free graph. We provide evidence for this conjecture by considering trees, cycles, the cube graph, and bipartite graphs with degrees bounded by k on one side, obtaining in all the cases similar bounds as in the non-induced setting. Our results also have applications to the Erdős-Hajnal conjecture, the problem of finding induced -free subgraphs with large degree and bounding the average degree of -free graphs which do not contain induced subdivisions of a fixed graph.
{"title":"Kővári-Sós-Turán theorem for hereditary families","authors":"Zach Hunter , Aleksa Milojević , Benny Sudakov , István Tomon","doi":"10.1016/j.jctb.2024.12.009","DOIUrl":"10.1016/j.jctb.2024.12.009","url":null,"abstract":"<div><div>The celebrated Kővári-Sós-Turán theorem states that any <em>n</em>-vertex graph containing no copy of the complete bipartite graph <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>s</mi><mo>,</mo><mi>s</mi></mrow></msub></math></span> has at most <span><math><msub><mrow><mi>O</mi></mrow><mrow><mi>s</mi></mrow></msub><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn><mo>−</mo><mn>1</mn><mo>/</mo><mi>s</mi></mrow></msup><mo>)</mo></math></span> edges. In the past two decades, motivated by the applications in discrete geometry and structural graph theory, a number of results demonstrated that this bound can be greatly improved if the graph satisfies certain structural restrictions. We propose the systematic study of this phenomenon, and state the conjecture that if <em>H</em> is a bipartite graph, then an induced <em>H</em>-free and <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>s</mi><mo>,</mo><mi>s</mi></mrow></msub></math></span>-free graph cannot have much more edges than an <em>H</em>-free graph. We provide evidence for this conjecture by considering trees, cycles, the cube graph, and bipartite graphs with degrees bounded by <em>k</em> on one side, obtaining in all the cases similar bounds as in the non-induced setting. Our results also have applications to the Erdős-Hajnal conjecture, the problem of finding induced <span><math><msub><mrow><mi>C</mi></mrow><mrow><mn>4</mn></mrow></msub></math></span>-free subgraphs with large degree and bounding the average degree of <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>s</mi><mo>,</mo><mi>s</mi></mrow></msub></math></span>-free graphs which do not contain induced subdivisions of a fixed graph.</div></div>","PeriodicalId":54865,"journal":{"name":"Journal of Combinatorial Theory Series B","volume":"172 ","pages":"Pages 168-197"},"PeriodicalIF":1.2,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143092868","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-05-01Epub Date: 2024-12-31DOI: 10.1016/j.jctb.2024.12.005
László Pyber , Saveliy V. Skresanov
The motion of a graph is the minimal degree of its full automorphism group. Babai conjectured that the motion of a primitive distance-regular graph on n vertices of diameter greater than two is at least for some universal constant , unless the graph is a Johnson or Hamming graph. We prove that the motion of a distance-regular graph of diameter on n vertices is at least for some universal constant , unless it is a Johnson, Hamming or crown graph. To show this, we improve an earlier result by Kivva who gave a lower bound on motion of the form , where depends exponentially on d. As a corollary we derive a quasipolynomial upper bound for the size of the automorphism group of a primitive distance-regular graph acting edge-transitively on the graph and on its distance-2 graph. The proofs use elementary combinatorial arguments and do not depend on the classification of finite simple groups.
{"title":"On the automorphism group of a distance-regular graph","authors":"László Pyber , Saveliy V. Skresanov","doi":"10.1016/j.jctb.2024.12.005","DOIUrl":"10.1016/j.jctb.2024.12.005","url":null,"abstract":"<div><div>The motion of a graph is the minimal degree of its full automorphism group. Babai conjectured that the motion of a primitive distance-regular graph on <em>n</em> vertices of diameter greater than two is at least <span><math><mi>n</mi><mo>/</mo><mi>C</mi></math></span> for some universal constant <span><math><mi>C</mi><mo>></mo><mn>0</mn></math></span>, unless the graph is a Johnson or Hamming graph. We prove that the motion of a distance-regular graph of diameter <span><math><mi>d</mi><mo>≥</mo><mn>3</mn></math></span> on <em>n</em> vertices is at least <span><math><mi>C</mi><mi>n</mi><mo>/</mo><msup><mrow><mo>(</mo><mi>log</mi><mo></mo><mi>n</mi><mo>)</mo></mrow><mrow><mn>6</mn></mrow></msup></math></span> for some universal constant <span><math><mi>C</mi><mo>></mo><mn>0</mn></math></span>, unless it is a Johnson, Hamming or crown graph. To show this, we improve an earlier result by Kivva who gave a lower bound on motion of the form <span><math><mi>n</mi><mo>/</mo><msub><mrow><mi>c</mi></mrow><mrow><mi>d</mi></mrow></msub></math></span>, where <span><math><msub><mrow><mi>c</mi></mrow><mrow><mi>d</mi></mrow></msub></math></span> depends exponentially on <em>d</em>. As a corollary we derive a quasipolynomial upper bound for the size of the automorphism group of a primitive distance-regular graph acting edge-transitively on the graph and on its distance-2 graph. The proofs use elementary combinatorial arguments and do not depend on the classification of finite simple groups.</div></div>","PeriodicalId":54865,"journal":{"name":"Journal of Combinatorial Theory Series B","volume":"172 ","pages":"Pages 94-114"},"PeriodicalIF":1.2,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143092866","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-05-01Epub Date: 2025-01-14DOI: 10.1016/j.jctb.2024.12.010
Tomasz Łuczak , Joanna Polcyn , Christian Reiher
Let denote the maximum number of edges in a triangle-free graph on n vertices which contains no independent sets larger than s. The behaviour of was first studied by Andrásfai, who conjectured that for this function is determined by appropriately chosen blow-ups of so called Andrásfai graphs. Moreover, he proved for and in earlier work we obtained for . Here we make the next step in the quest to settle Andrásfai's conjecture by proving for .
{"title":"The next case of Andrásfai's conjecture","authors":"Tomasz Łuczak , Joanna Polcyn , Christian Reiher","doi":"10.1016/j.jctb.2024.12.010","DOIUrl":"10.1016/j.jctb.2024.12.010","url":null,"abstract":"<div><div>Let <span><math><mrow><mi>ex</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>s</mi><mo>)</mo></math></span> denote the maximum number of edges in a triangle-free graph on <em>n</em> vertices which contains no independent sets larger than <em>s</em>. The behaviour of <span><math><mrow><mi>ex</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>s</mi><mo>)</mo></math></span> was first studied by Andrásfai, who conjectured that for <span><math><mi>s</mi><mo>></mo><mi>n</mi><mo>/</mo><mn>3</mn></math></span> this function is determined by appropriately chosen blow-ups of so called Andrásfai graphs. Moreover, he proved <span><math><mrow><mi>ex</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>s</mi><mo>)</mo><mo>=</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>−</mo><mn>4</mn><mi>n</mi><mi>s</mi><mo>+</mo><mn>5</mn><msup><mrow><mi>s</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span> for <span><math><mi>s</mi><mo>/</mo><mi>n</mi><mo>∈</mo><mo>[</mo><mn>2</mn><mo>/</mo><mn>5</mn><mo>,</mo><mn>1</mn><mo>/</mo><mn>2</mn><mo>]</mo></math></span> and in earlier work we obtained <span><math><mrow><mi>ex</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>s</mi><mo>)</mo><mo>=</mo><mn>3</mn><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>−</mo><mn>15</mn><mi>n</mi><mi>s</mi><mo>+</mo><mn>20</mn><msup><mrow><mi>s</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span> for <span><math><mi>s</mi><mo>/</mo><mi>n</mi><mo>∈</mo><mo>[</mo><mn>3</mn><mo>/</mo><mn>8</mn><mo>,</mo><mn>2</mn><mo>/</mo><mn>5</mn><mo>]</mo></math></span>. Here we make the next step in the quest to settle Andrásfai's conjecture by proving <span><math><mrow><mi>ex</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>s</mi><mo>)</mo><mo>=</mo><mn>6</mn><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>−</mo><mn>32</mn><mi>n</mi><mi>s</mi><mo>+</mo><mn>44</mn><msup><mrow><mi>s</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span> for <span><math><mi>s</mi><mo>/</mo><mi>n</mi><mo>∈</mo><mo>[</mo><mn>4</mn><mo>/</mo><mn>11</mn><mo>,</mo><mn>3</mn><mo>/</mo><mn>8</mn><mo>]</mo></math></span>.</div></div>","PeriodicalId":54865,"journal":{"name":"Journal of Combinatorial Theory Series B","volume":"172 ","pages":"Pages 198-220"},"PeriodicalIF":1.2,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143092869","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-05-01Epub Date: 2025-01-23DOI: 10.1016/j.jctb.2025.01.001
Jianfeng Hou , Caiyun Hu , Heng Li , Xizhi Liu , Caihong Yang , Yixiao Zhang
Given an r-graph F with , let denote the maximum number of edges in an n-vertex r-graph with at most t pairwise vertex-disjoint copies of F. Extending several old results and complementing prior work [34] on nondegenerate hypergraphs, we initiate a systematic study on for degenerate hypergraphs F.
For a broad class of degenerate hypergraphs F, we present near-optimal upper bounds for when n is sufficiently large and t lies in intervals , , and , where is a constant depending only on F. Our results reveal very different structures for extremal constructions across the three intervals, and we provide characterizations of extremal constructions within the first interval. Additionally, we characterize extremal constructions within the second interval for graphs. Our proof for the first interval also applies to a special class of nondegenerate hypergraphs, including those with undetermined Turán densities, partially improving a result in [34].
{"title":"Toward a density Corrádi–Hajnal theorem for degenerate hypergraphs","authors":"Jianfeng Hou , Caiyun Hu , Heng Li , Xizhi Liu , Caihong Yang , Yixiao Zhang","doi":"10.1016/j.jctb.2025.01.001","DOIUrl":"10.1016/j.jctb.2025.01.001","url":null,"abstract":"<div><div>Given an <em>r</em>-graph <em>F</em> with <span><math><mi>r</mi><mo>≥</mo><mn>2</mn></math></span>, let <span><math><mrow><mi>ex</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mo>(</mo><mi>t</mi><mo>+</mo><mn>1</mn><mo>)</mo><mi>F</mi><mo>)</mo></math></span> denote the maximum number of edges in an <em>n</em>-vertex <em>r</em>-graph with at most <em>t</em> pairwise vertex-disjoint copies of <em>F</em>. Extending several old results and complementing prior work <span><span>[34]</span></span> on nondegenerate hypergraphs, we initiate a systematic study on <span><math><mrow><mi>ex</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mo>(</mo><mi>t</mi><mo>+</mo><mn>1</mn><mo>)</mo><mi>F</mi><mo>)</mo></math></span> for degenerate hypergraphs <em>F</em>.</div><div>For a broad class of degenerate hypergraphs <em>F</em>, we present near-optimal upper bounds for <span><math><mrow><mi>ex</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mo>(</mo><mi>t</mi><mo>+</mo><mn>1</mn><mo>)</mo><mi>F</mi><mo>)</mo></math></span> when <em>n</em> is sufficiently large and <em>t</em> lies in intervals <span><math><mo>[</mo><mn>0</mn><mo>,</mo><mfrac><mrow><mi>ε</mi><mo>⋅</mo><mrow><mi>ex</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>F</mi><mo>)</mo></mrow><mrow><msup><mrow><mi>n</mi></mrow><mrow><mi>r</mi><mo>−</mo><mn>1</mn></mrow></msup></mrow></mfrac><mo>]</mo></math></span>, <span><math><mo>[</mo><mfrac><mrow><mrow><mi>ex</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>F</mi><mo>)</mo></mrow><mrow><mi>ε</mi><msup><mrow><mi>n</mi></mrow><mrow><mi>r</mi><mo>−</mo><mn>1</mn></mrow></msup></mrow></mfrac><mo>,</mo><mi>ε</mi><mi>n</mi><mo>]</mo></math></span>, and <span><math><mo>[</mo><mo>(</mo><mn>1</mn><mo>−</mo><mi>ε</mi><mo>)</mo><mfrac><mrow><mi>n</mi></mrow><mrow><mi>v</mi><mo>(</mo><mi>F</mi><mo>)</mo></mrow></mfrac><mo>,</mo><mfrac><mrow><mi>n</mi></mrow><mrow><mi>v</mi><mo>(</mo><mi>F</mi><mo>)</mo></mrow></mfrac><mo>]</mo></math></span>, where <span><math><mi>ε</mi><mo>></mo><mn>0</mn></math></span> is a constant depending only on <em>F</em>. Our results reveal very different structures for extremal constructions across the three intervals, and we provide characterizations of extremal constructions within the first interval. Additionally, we characterize extremal constructions within the second interval for graphs. Our proof for the first interval also applies to a special class of nondegenerate hypergraphs, including those with undetermined Turán densities, partially improving a result in <span><span>[34]</span></span>.</div></div>","PeriodicalId":54865,"journal":{"name":"Journal of Combinatorial Theory Series B","volume":"172 ","pages":"Pages 221-262"},"PeriodicalIF":1.2,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143092870","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We prove that there exists a function such that every directed graph G contains either k directed odd cycles where every vertex of G is contained in at most two of them, or a set of at most vertices meeting all directed odd cycles. We give a polynomial-time algorithm for fixed k which outputs one of the two outcomes. This extends the half-integral Erdős-Pósa theorem for undirected odd cycles by Reed [Combinatorica 1999] to directed graphs.
{"title":"A half-integral Erdős-Pósa theorem for directed odd cycles","authors":"Ken-ichi Kawarabayashi , Stephan Kreutzer , O-joung Kwon , Qiqin Xie","doi":"10.1016/j.jctb.2024.12.008","DOIUrl":"10.1016/j.jctb.2024.12.008","url":null,"abstract":"<div><div>We prove that there exists a function <span><math><mi>f</mi><mo>:</mo><mi>N</mi><mo>→</mo><mi>R</mi></math></span> such that every directed graph <em>G</em> contains either <em>k</em> directed odd cycles where every vertex of <em>G</em> is contained in at most two of them, or a set of at most <span><math><mi>f</mi><mo>(</mo><mi>k</mi><mo>)</mo></math></span> vertices meeting all directed odd cycles. We give a polynomial-time algorithm for fixed <em>k</em> which outputs one of the two outcomes. This extends the half-integral Erdős-Pósa theorem for undirected odd cycles by Reed [Combinatorica 1999] to directed graphs.</div></div>","PeriodicalId":54865,"journal":{"name":"Journal of Combinatorial Theory Series B","volume":"172 ","pages":"Pages 115-145"},"PeriodicalIF":1.2,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143092867","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-05-01Epub Date: 2024-12-18DOI: 10.1016/j.jctb.2024.12.002
Eimear Byrne, Andrew Fulcher
We describe a construction of the Tutte polynomial for both matroids and q-matroids based on an appropriate partition of the underlying support lattice into intervals that correspond to prime-free minors, which we call a Tutte partition. We show that such partitions in the matroid case include the class of partitions arising in Crapo's definition of the Tutte polynomial, while not representing a direct q-analogue of such partitions. We propose axioms of a q-Tutte-Grothendieck invariant and show that this yields a q-analogue of a Tutte-Grothendieck invariant. We establish the connection between the rank generating polynomial and the Tutte polynomial, showing that one can be obtained from the other by convolution.
{"title":"Invariants of Tutte partitions and a q-analogue","authors":"Eimear Byrne, Andrew Fulcher","doi":"10.1016/j.jctb.2024.12.002","DOIUrl":"10.1016/j.jctb.2024.12.002","url":null,"abstract":"<div><div>We describe a construction of the Tutte polynomial for both matroids and <em>q</em>-matroids based on an appropriate partition of the underlying support lattice into intervals that correspond to prime-free minors, which we call a Tutte partition. We show that such partitions in the matroid case include the class of partitions arising in Crapo's definition of the Tutte polynomial, while not representing a direct <em>q</em>-analogue of such partitions. We propose axioms of a <em>q</em>-Tutte-Grothendieck invariant and show that this yields a <em>q</em>-analogue of a Tutte-Grothendieck invariant. We establish the connection between the rank generating polynomial and the Tutte polynomial, showing that one can be obtained from the other by convolution.</div></div>","PeriodicalId":54865,"journal":{"name":"Journal of Combinatorial Theory Series B","volume":"172 ","pages":"Pages 1-43"},"PeriodicalIF":1.2,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143092945","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-03-01Epub Date: 2024-12-18DOI: 10.1016/j.jctb.2024.12.001
Peter Frankl , Jian Wang
We consider k-graphs on n vertices, that is, . A k-graph is called intersecting if for all . In the present paper we prove that for , , any intersecting k-graph with covering number at least three, satisfies , the best possible upper bound which was proved in [4] subject to exponential constraints .
{"title":"Intersecting families with covering number three","authors":"Peter Frankl , Jian Wang","doi":"10.1016/j.jctb.2024.12.001","DOIUrl":"10.1016/j.jctb.2024.12.001","url":null,"abstract":"<div><div>We consider <em>k</em>-graphs on <em>n</em> vertices, that is, <span><math><mi>F</mi><mo>⊂</mo><mrow><mo>(</mo><mtable><mtr><mtd><mrow><mo>[</mo><mi>n</mi><mo>]</mo></mrow></mtd></mtr><mtr><mtd><mi>k</mi></mtd></mtr></mtable><mo>)</mo></mrow></math></span>. A <em>k</em>-graph <span><math><mi>F</mi></math></span> is called intersecting if <span><math><mi>F</mi><mo>∩</mo><msup><mrow><mi>F</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>≠</mo><mo>∅</mo></math></span> for all <span><math><mi>F</mi><mo>,</mo><msup><mrow><mi>F</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>∈</mo><mi>F</mi></math></span>. In the present paper we prove that for <span><math><mi>k</mi><mo>≥</mo><mn>7</mn></math></span>, <span><math><mi>n</mi><mo>≥</mo><mn>2</mn><mi>k</mi></math></span>, any intersecting <em>k</em>-graph <span><math><mi>F</mi></math></span> with covering number at least three, satisfies <span><math><mo>|</mo><mi>F</mi><mo>|</mo><mo>≤</mo><mrow><mo>(</mo><mtable><mtr><mtd><mrow><mi>n</mi><mo>−</mo><mn>1</mn></mrow></mtd></mtr><mtr><mtd><mrow><mi>k</mi><mo>−</mo><mn>1</mn></mrow></mtd></mtr></mtable><mo>)</mo></mrow><mo>−</mo><mrow><mo>(</mo><mtable><mtr><mtd><mrow><mi>n</mi><mo>−</mo><mi>k</mi></mrow></mtd></mtr><mtr><mtd><mrow><mi>k</mi><mo>−</mo><mn>1</mn></mrow></mtd></mtr></mtable><mo>)</mo></mrow><mo>−</mo><mrow><mo>(</mo><mtable><mtr><mtd><mrow><mi>n</mi><mo>−</mo><mi>k</mi><mo>−</mo><mn>1</mn></mrow></mtd></mtr><mtr><mtd><mrow><mi>k</mi><mo>−</mo><mn>1</mn></mrow></mtd></mtr></mtable><mo>)</mo></mrow><mo>+</mo><mrow><mo>(</mo><mtable><mtr><mtd><mrow><mi>n</mi><mo>−</mo><mn>2</mn><mi>k</mi></mrow></mtd></mtr><mtr><mtd><mrow><mi>k</mi><mo>−</mo><mn>1</mn></mrow></mtd></mtr></mtable><mo>)</mo></mrow><mo>+</mo><mrow><mo>(</mo><mtable><mtr><mtd><mrow><mi>n</mi><mo>−</mo><mi>k</mi><mo>−</mo><mn>2</mn></mrow></mtd></mtr><mtr><mtd><mrow><mi>k</mi><mo>−</mo><mn>3</mn></mrow></mtd></mtr></mtable><mo>)</mo></mrow><mo>+</mo><mn>3</mn></math></span>, the best possible upper bound which was proved in <span><span>[4]</span></span> subject to exponential constraints <span><math><mi>n</mi><mo>></mo><msub><mrow><mi>n</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>(</mo><mi>k</mi><mo>)</mo></math></span>.</div></div>","PeriodicalId":54865,"journal":{"name":"Journal of Combinatorial Theory Series B","volume":"171 ","pages":"Pages 96-139"},"PeriodicalIF":1.2,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142929317","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-03-01Epub Date: 2024-12-19DOI: 10.1016/j.jctb.2024.12.003
Yunsong Gan , Weijun Liu , Binzhou Xia
A pair of graphs is called unstable if their direct product has automorphisms that do not come from , and such automorphisms are said to be unexpected. In the special case when , the stability of is well studied in the literature, where the so-called two-fold automorphisms of the graph Γ have played an important role. As a generalization of two-fold automorphisms, the concept of non-diagonal automorphisms was recently introduced to study the stability of general graph pairs. In this paper, we obtain, for a large family of graph pairs, a necessary and sufficient condition to be unstable in terms of the existence of non-diagonal automorphisms. As a byproduct, we determine the stability of graph pairs involving complete graphs or odd cycles, respectively. The former result in fact solves a problem proposed by Dobson, Miklavič and Šparl for undirected graphs, as well as confirms a recent conjecture of Qin, Xia and Zhou.
{"title":"Unexpected automorphisms in direct product graphs","authors":"Yunsong Gan , Weijun Liu , Binzhou Xia","doi":"10.1016/j.jctb.2024.12.003","DOIUrl":"10.1016/j.jctb.2024.12.003","url":null,"abstract":"<div><div>A pair of graphs <span><math><mo>(</mo><mi>Γ</mi><mo>,</mo><mi>Σ</mi><mo>)</mo></math></span> is called unstable if their direct product <span><math><mi>Γ</mi><mo>×</mo><mi>Σ</mi></math></span> has automorphisms that do not come from <span><math><mtext>Aut</mtext><mo>(</mo><mi>Γ</mi><mo>)</mo><mo>×</mo><mtext>Aut</mtext><mo>(</mo><mi>Σ</mi><mo>)</mo></math></span>, and such automorphisms are said to be unexpected. In the special case when <span><math><mi>Σ</mi><mo>=</mo><msub><mrow><mi>K</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span>, the stability of <span><math><mo>(</mo><mi>Γ</mi><mo>,</mo><msub><mrow><mi>K</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>)</mo></math></span> is well studied in the literature, where the so-called two-fold automorphisms of the graph Γ have played an important role. As a generalization of two-fold automorphisms, the concept of non-diagonal automorphisms was recently introduced to study the stability of general graph pairs. In this paper, we obtain, for a large family of graph pairs, a necessary and sufficient condition to be unstable in terms of the existence of non-diagonal automorphisms. As a byproduct, we determine the stability of graph pairs involving complete graphs or odd cycles, respectively. The former result in fact solves a problem proposed by Dobson, Miklavič and Šparl for undirected graphs, as well as confirms a recent conjecture of Qin, Xia and Zhou.</div></div>","PeriodicalId":54865,"journal":{"name":"Journal of Combinatorial Theory Series B","volume":"171 ","pages":"Pages 140-164"},"PeriodicalIF":1.2,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142929318","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-03-01Epub Date: 2024-11-28DOI: 10.1016/j.jctb.2024.11.002
Ji Zeng
We prove that every n-vertex complete simple topological graph generates at least pairwise disjoint 4-faces. This improves upon a recent result by Hubard and Suk. As an immediate corollary, every n-vertex complete simple topological graph drawn in the unit square generates a 4-face with area at most . This can be seen as a topological variant of the Heilbronn problem for quadrilaterals. We construct examples showing that our result is asymptotically tight. We also discuss the similar problem for k-faces with arbitrary .
{"title":"Note on disjoint faces in simple topological graphs","authors":"Ji Zeng","doi":"10.1016/j.jctb.2024.11.002","DOIUrl":"10.1016/j.jctb.2024.11.002","url":null,"abstract":"<div><div>We prove that every <em>n</em>-vertex complete simple topological graph generates at least <span><math><mi>Ω</mi><mo>(</mo><mi>n</mi><mo>)</mo></math></span> pairwise disjoint 4-faces. This improves upon a recent result by Hubard and Suk. As an immediate corollary, every <em>n</em>-vertex complete simple topological graph drawn in the unit square generates a 4-face with area at most <span><math><mi>O</mi><mo>(</mo><mn>1</mn><mo>/</mo><mi>n</mi><mo>)</mo></math></span>. This can be seen as a topological variant of the Heilbronn problem for quadrilaterals. We construct examples showing that our result is asymptotically tight. We also discuss the similar problem for <em>k</em>-faces with arbitrary <span><math><mi>k</mi><mo>≥</mo><mn>3</mn></math></span>.</div></div>","PeriodicalId":54865,"journal":{"name":"Journal of Combinatorial Theory Series B","volume":"171 ","pages":"Pages 28-35"},"PeriodicalIF":1.2,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142743022","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号