Maximum Bisections of Graphs Without Adjacent Quadrilaterals

被引：0
|
作者：
Hu, Qiming [1 ]
Xu, Baogang [1 ]
机构：
[1] Nanjing Normal Univ, Inst Math, Sch Math Sci, 1 Wenyuan Rd, Nanjing 210023, Peoples R China
来源：
GRAPHS AND COMBINATORICS | 2025年 / 41卷 / 01期
基金：
中国国家自然科学基金;
关键词：
Bipartition; Bisection; C-6-free graphs; BIPARTITE SUBGRAPHS;
D O I：
10.1007/s00373-025-02889-7
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let Ck be a cycle of length k . Let G be a graph with n vertices, m edges. Lin and Zeng proved that if G has a perfect matching and does not contain C-4 , C-6 and C-2k , then G admits a bisection of size at least m|2 + c(k)m((2k+1)/(2k+2)) and showed that the bound is tight for k E { 3 , 5}. In this paper, we obtain a similar tight result by replacing C-4 with two adjacent C-4's.
引用
收藏
页数：29
相关论文
共 50 条
  • [41] Vertex-disjoint quadrilaterals in graphs
    Wang, H
    DISCRETE MATHEMATICS, 2004, 288 (1-3) : 149 - 166
  • [42] OPTIMAL CHEEGER CUTS AND BISECTIONS OF RANDOM GEOMETRIC GRAPHS
    Mueller, Tobias
    Penrose, Mathew D.
    ANNALS OF APPLIED PROBABILITY, 2020, 30 (03): : 1458 - 1483
  • [43] Convex embeddings and bisections of 3-connected graphs
    Nagamochi, H
    Jordán, T
    Nakao, Y
    Ibaraki, T
    COMBINATORICA, 2002, 22 (04) : 537 - 554
  • [44] Max-Bisections of H-free graphs
    Hou, Jianfeng
    Yan, Juan
    DISCRETE MATHEMATICS, 2020, 343 (0I)
  • [45] Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
    Lu, You
    Li, Jiaao
    Luo, Rong
    Miao, Zhengke
    DISCRETE MATHEMATICS, 2017, 340 (02) : 119 - 123
  • [46] Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ
    Hervé Hocquard
    Mickaël Montassier
    Journal of Combinatorial Optimization, 2013, 26 : 152 - 160
  • [47] Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ
    Hocquard, Herve
    Montassier, Mickael
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 26 (01) : 152 - 160
  • [48] Acyclic Edge Coloring of Planar Graphs without Adjacent Triangles
    Dezheng XIE Yanqing WU College of Mathematics and StatisticsChongqing UniversityChongqing PRChinaSchool of Mathematics and Computer ScienceShanxi Normal UniversityShanxi PRChina
    数学研究及应用, 2012, 32 (04) : 407 - 414
  • [49] Total coloring of planar graphs without adjacent short cycles
    Huijuan Wang
    Bin Liu
    Yan Gu
    Xin Zhang
    Weili Wu
    Hongwei Gao
    Journal of Combinatorial Optimization, 2017, 33 : 265 - 274
  • [50] EVERY TOROIDAL GRAPHS WITHOUT ADJACENT TRIANGLES IS AT MOST 8
    Tian, Fangyu
    Yin, Yuxue
    arXiv, 2022,
12345