Journal of Graph Theory最新文献_第4页

A Proof to Bang-Jensen, Havet and Yeo's Conjecture on the Hamiltonian Cycles Avoiding Prescribed Arcs in Semicomplete Digraphs 半完全有向图中避开规定弧的哈密顿环的Bang-Jensen、Havet和Yeo猜想的证明

IF 1 3区数学

Journal of Graph Theory Pub Date : 2025-05-09 DOI: 10.1002/jgt.23256

Ruijuan Li, Yaoxiang Di, Ruiping Zhang, Xinhong Zhang

{"title":"A Proof to Bang-Jensen, Havet and Yeo's Conjecture on the Hamiltonian Cycles Avoiding Prescribed Arcs in Semicomplete Digraphs","authors":"Ruijuan Li, Yaoxiang Di, Ruiping Zhang, Xinhong Zhang","doi":"10.1002/jgt.23256","DOIUrl":"https://doi.org/10.1002/jgt.23256","url":null,"abstract":"<div>\u0000 \u0000 In 2023, Bang-Jensen, Havet and Yeo [J. Graph Theory 102 (2023) 578-606] conjectured that every <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mrow>\u0000 <mi>k</mi>\u0000 \u0000 <mo>+</mo>\u0000 \u0000 <mn>2</mn>\u0000 </mrow>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>-strong semicomplete digraph contains a hamiltonian cycle avoiding any prescribed set of <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>k</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> arcs, which was inspired by the result of Fraisse and Thomassen that, every <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mrow>\u0000 <mi>k</mi>\u0000 \u0000 <mo>+</mo>\u0000 \u0000 <mn>1</mn>\u0000 </mrow>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>-strong tournament contains a hamiltonian cycle avoiding any prescribed set of <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>k</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> arcs. In this paper, we prove the conjecture.\u0000 </div>","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"110 2","pages":"145-154"},"PeriodicalIF":1.0,"publicationDate":"2025-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144805836","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Pseudo-Multifan and Lollipop 伪多扇和棒棒糖

IF 1 3区数学

Journal of Graph Theory Pub Date : 2025-05-09 DOI: 10.1002/jgt.23258

Yan Cao, Guantao Chen, Guangming Jing, Songling Shan

{"title":"Pseudo-Multifan and Lollipop","authors":"Yan Cao, Guantao Chen, Guangming Jing, Songling Shan","doi":"10.1002/jgt.23258","DOIUrl":"https://doi.org/10.1002/jgt.23258","url":null,"abstract":"<div>\u0000 \u0000 A subgraph <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>H</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> of a graph <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> with maximum degree <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>Δ</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> is <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>Δ</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>-overfull if <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mo>∣</mo>\u0000 \u0000 <mi>E</mi>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mi>H</mi>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 \u0000 <mo>∣</mo>\u0000 \u0000 <mo>></mo>\u0000 \u0000 <mi>Δ</mi>\u0000 \u0000 <mrow>\u0000 <mo>⌊</mo>\u0000 \u0000 <mrow>\u0000 <mo>∣</mo>\u0000 \u0000 <mi>V</mi>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mi>H</mi>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 \u0000 <mo>∣</mo>\u0000 \u0000 <mo>∕</mo>\u0000 \u0000 <mn>2</mn>\u0000 </mrow>\u0000 \u0000 <mo>⌋</mo>\u0000 </mrow>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>. Clearly, if <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> contains a <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>Δ</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>-overfull subgraph, then ","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"110 2","pages":"155-166"},"PeriodicalIF":1.0,"publicationDate":"2025-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144811144","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Nordhaus–Gaddum Problem for the Spectral Gap of a Graph 图的谱隙的Nordhaus-Gaddum问题

IF 1 3区数学

Journal of Graph Theory Pub Date : 2025-05-04 DOI: 10.1002/jgt.23253

Sooyeong Kim, Neal Madras

{"title":"A Nordhaus–Gaddum Problem for the Spectral Gap of a Graph","authors":"Sooyeong Kim, Neal Madras","doi":"10.1002/jgt.23253","DOIUrl":"https://doi.org/10.1002/jgt.23253","url":null,"abstract":"Let <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> be a graph on <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>n</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> vertices, with complement <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mover>\u0000 <mi>G</mi>\u0000 \u0000 <mo>¯</mo>\u0000 </mover>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>. The spectral gap of the transition probability matrix of a random walk on <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> is used to estimate how fast the random walk becomes stationary. We prove that the larger spectral gap of <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> and <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mover>\u0000 <mi>G</mi>\u0000 \u0000 <mo>¯</mo>\u0000 </mover>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> is <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>Ω</mi>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mrow>\u0000 <mn>1</mn>\u0000 \u0000 <mo>∕</mo>\u0000 \u0000 <mi>n</mi>\u0000 </mrow>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>. Moreover, if all degrees are <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>Ω</mi>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 ","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"110 2","pages":"132-144"},"PeriodicalIF":1.0,"publicationDate":"2025-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23253","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144811248","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Extremal Results on Disjoint Cycles in Tournaments and Bipartite Tournaments 竞赛和二部竞赛中不相交环的极值结果

IF 0.9 3区数学

Journal of Graph Theory Pub Date : 2025-04-28 DOI: 10.1002/jgt.23255

Bin Chen

{"title":"Extremal Results on Disjoint Cycles in Tournaments and Bipartite Tournaments","authors":"Bin Chen","doi":"10.1002/jgt.23255","DOIUrl":"https://doi.org/10.1002/jgt.23255","url":null,"abstract":"<div>\u0000 \u0000 In this paper, we give two extremal results on vertex disjoint-directed cycles in tournaments and bipartite tournaments. Let <math>\u0000 \u0000 <mrow>\u0000 <mi>q</mi>\u0000 \u0000 <mo>≥</mo>\u0000 \u0000 <mn>2</mn>\u0000 </mrow></math> and <math>\u0000 \u0000 <mrow>\u0000 <mi>k</mi>\u0000 \u0000 <mo>≥</mo>\u0000 \u0000 <mn>2</mn>\u0000 </mrow></math> be two integers. The first result is that for every strong tournament <math>\u0000 \u0000 <mrow>\u0000 <mi>D</mi>\u0000 </mrow></math>, with a minimum out-degree of at least <math>\u0000 \u0000 <mrow>\u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mrow>\u0000 <mi>q</mi>\u0000 \u0000 <mo>−</mo>\u0000 \u0000 <mn>1</mn>\u0000 </mrow>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 \u0000 <mi>k</mi>\u0000 \u0000 <mo>−</mo>\u0000 \u0000 <mn>1</mn>\u0000 </mrow></math> with <math>\u0000 \u0000 <mrow>\u0000 <mi>q</mi>\u0000 \u0000 <mo>≥</mo>\u0000 \u0000 <mn>3</mn>\u0000 </mrow></math>, any <math>\u0000 \u0000 <mrow>\u0000 <mi>k</mi>\u0000 </mrow></math> vertex disjoint-directed cycle, which has a length of at least <math>\u0000 \u0000 <mrow>\u0000 <mi>q</mi>\u0000 </mrow></math> in <math>\u0000 \u0000 <mrow>\u0000 <mi>D</mi>\u0000 </mrow></math>, has the same length if and only if <math>\u0000 \u0000 <mrow>\u0000 <mi>q</mi>\u0000 \u0000 <mo>=</mo>\u0000 \u0000 <mn>3</mn>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mi>k</mi>\u0000 \u0000 <mo>=</mo>\u0000 \u0000 <mn>2</mn>\u0000 </mrow></math> and <math>\u0000 \u0000 <mrow>\u0000 <mi>D</mi>\u0000 </mrow></math> is isomorphic to <math>\u0000 \u0000 <mrow>\u0000 <mi>P</mi>\u0000 \u0000 <msub>\u0000 <mi>T</mi>\u0000 \u0000 <mn>7</mn>\u0000 </msub>\u0000 </mrow></math>. The second result is that for each strong bipartite tournament <math>\u0000 \u0000 <mrow>\u0000 <mi>D</mi>\u0000 </mrow></math>, with a minimum out-degree of at least <math>\u0000 \u0000 <mrow>\u0000 <mi>q</mi>\u0000 \u0000 <mi>k</mi>\u0000 \u0000 <mo>−</mo>\u0000 ","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"110 1","pages":"111-121"},"PeriodicalIF":0.9,"publicationDate":"2025-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144624549","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Chromatic Polynomials of Signed Graphs and Dominating-Vertex Deletion Formulae 符号图的色多项式与控制顶点删除公式

IF 0.9 3区数学

Journal of Graph Theory Pub Date : 2025-04-28 DOI: 10.1002/jgt.23236

Gary R. W. Greaves, Jeven Syatriadi, Charissa I. Utomo

引用次数: 0

Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials 竞赛和新有向图多项式中的子图及其逆数

IF 1 3区数学

Journal of Graph Theory Pub Date : 2025-04-28 DOI: 10.1002/jgt.23257

Jiangdong Ai, Gregory Gutin, Hui Lei, Anders Yeo, Yacong Zhou

{"title":"Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials","authors":"Jiangdong Ai, Gregory Gutin, Hui Lei, Anders Yeo, Yacong Zhou","doi":"10.1002/jgt.23257","DOIUrl":"https://doi.org/10.1002/jgt.23257","url":null,"abstract":"An oriented graph <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>D</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> is converse invariant if, for any tournament <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>T</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>, the number of copies of <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>D</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> in <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>T</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> is equal to that of its converse <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mo>−</mo>\u0000 \u0000 <mi>D</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>. El Sahili and Ghazo Hanna [J. Graph Theory 102 (2023), 684-701] showed that any oriented graph <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>D</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> with maximum degree at most 2 is converse invariant. They proposed a question: Can we characterize all converse invariant oriented graphs? In this paper, we introduce a digraph polynomial and employ it to give a necessary condition for an oriented graph to be converse invariant. This polynomial serves as a cornerstone in proving all the results presented in this paper. In particular, we characterize all orientations of trees with diameter at most 3 that are converse invariant. We also show that all orientations of regular graphs are not converse invariant if <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>D</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> and <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mo>−</mo>\u0000 \u0000 <mi>D</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> have different degree sequences. In addition, in contrast to the findings of El Sahili and Ghazo Hanna, w","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"110 2","pages":"127-131"},"PeriodicalIF":1.0,"publicationDate":"2025-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23257","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144810990","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

On k -Edge-Hamilton-Connected Line Graphs 关于k边-哈密顿连通线图

IF 0.9 3区数学

Journal of Graph Theory Pub Date : 2025-04-23 DOI: 10.1002/jgt.23252

Baoleer, Kenta Ozeki

{"title":"On \u0000 \u0000 \u0000 \u0000 k\u0000 \u0000 \u0000 -Edge-Hamilton-Connected Line Graphs","authors":"Baoleer, Kenta Ozeki","doi":"10.1002/jgt.23252","DOIUrl":"https://doi.org/10.1002/jgt.23252","url":null,"abstract":"<div>\u0000 \u0000 We say that a graph <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> is <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>k</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>-edge-Hamilton-connected if <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 \u0000 <mo>+</mo>\u0000 \u0000 <mi>M</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> has a Hamilton cycle containing all edges of <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>M</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> for any <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>M</mi>\u0000 \u0000 <mo>⊆</mo>\u0000 \u0000 <mrow>\u0000 <mo>{</mo>\u0000 \u0000 <mrow>\u0000 <mi>x</mi>\u0000 \u0000 <mi>y</mi>\u0000 \u0000 <mo>∣</mo>\u0000 \u0000 <mi>x</mi>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mi>y</mi>\u0000 \u0000 <mo>∈</mo>\u0000 \u0000 <mi>V</mi>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mi>G</mi>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 \u0000 <mo>}</mo>\u0000 </mrow>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> with <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mo>∣</mo>\u0000 \u0000 <mi>M</mi>\u0000 \u0000 <mo>∣</mo>\u0000 \u0000 <mo>≤</mo>\u0000 \u0000 <mi>k</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> such that <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 ","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"110 1","pages":"92-100"},"PeriodicalIF":0.9,"publicationDate":"2025-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144624694","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

On Tournament Inversion 关于比赛反转

IF 0.9 3区数学

Journal of Graph Theory Pub Date : 2025-04-22 DOI: 10.1002/jgt.23251

Raphael Yuster

{"title":"On Tournament Inversion","authors":"Raphael Yuster","doi":"10.1002/jgt.23251","DOIUrl":"https://doi.org/10.1002/jgt.23251","url":null,"abstract":"An inversion of a tournament <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>T</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> is obtained by reversing the direction of all edges with both endpoints in some set of vertices. Let <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <msub>\u0000 <mtext>inv</mtext>\u0000 \u0000 <mi>k</mi>\u0000 </msub>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mi>T</mi>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> be the minimum length of a sequence of inversions using sets of size at most <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>k</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> that result in the transitive tournament. Let <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <msub>\u0000 <mtext>inv</mtext>\u0000 \u0000 <mi>k</mi>\u0000 </msub>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mi>n</mi>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> be the maximum of <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <msub>\u0000 <mtext>inv</mtext>\u0000 \u0000 <mi>k</mi>\u0000 </msub>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mi>T</mi>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> taken over <math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>n</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>-vertex tournaments. It is well k","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"110 1","pages":"82-91"},"PeriodicalIF":0.9,"publicationDate":"2025-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23251","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144624602","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Weighted Turán Theorems With Applications to Ramsey-Turán Type of Problems 加权Turán定理及其在Ramsey-Turán类型问题中的应用

IF 0.9 3区数学

Journal of Graph Theory Pub Date : 2025-04-18 DOI: 10.1002/jgt.23244

József Balogh, Domagoj Bradač, Bernard Lidický

引用次数: 0

4-Connected 1-Planar Chordal Graphs Are Hamiltonian-Connected 4连通1-平面弦图是哈密顿连通的

IF 0.9 3区数学

Journal of Graph Theory Pub Date : 2025-04-18 DOI: 10.1002/jgt.23250

Licheng Zhang, Yuanqiu Huang, Shengxiang Lv, Fengming Dong

引用次数: 0