Almost Resolvable Maximum Packings of Complete Graphs with 4-Cycles

被引:0
|
作者
Elizabeth J. Billington
Italo J. Dejter
D. G. Hoffman
C. C. Lindner
机构
[1] The University of Queensland,Department of Mathematics
[2] University of Puerto Rico,Department of Mathematics and Computer Science
[3] Auburn University,Department of Mathematics and Statistics
来源
Graphs and Combinatorics | 2011年 / 27卷
关键词
4-Cycle system; Resolvable cycle system maximum packing; Almost resolvable maximum packing; 05B30; 05C38;
D O I
暂无
中图分类号
学科分类号
摘要
If the complete graph Kn has vertex set X, a maximum packing of Kn with 4-cycles, (X, C, L), is an edge-disjoint decomposition of Kn into a collection C of 4-cycles so that the unused edges (the set L) is as small a set as possible. Maximum packings of Kn with 4-cycles were shown to exist by Schönheim and Bialostocki (Can. Math. Bull. 18:703–708, 1975). An almost parallel class of a maximum packing (X, C, L) of Kn with 4-cycles is a largest possible collection of vertex disjoint 4-cycles (so with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\lfloor/4\rfloor}$$\end{document} 4-cycles in it). In this paper, for all orders n, except 9, which does not exist, and possibly 23, 41 and 57, we exhibit a maximum packing of Kn with 4-cycles so that the 4-cycles in the packing are resolvable into almost parallel classes, with any remaining 4-cycles being vertex disjoint. [Note: The three missing orders have now been found, and appear in Billington et al. (to appear).]
引用
收藏
页码:161 / 170
页数:9
相关论文
共 50 条
  • [31] Sidon sets and graphs without 4-cycles
    Tait, Michael
    Timmons, Craig
    JOURNAL OF COMBINATORICS, 2014, 5 (02) : 155 - 165
  • [32] Decomposing dense bipartite graphs into 4-cycles
    Cavenagh, Nicholas J.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (01):
  • [33] On the existence of maximum resolvable (K4-e)-packings
    Wang, Lidong
    Su, Renwang
    DISCRETE MATHEMATICS, 2010, 310 (04) : 887 - 896
  • [34] FLEXIBILITY OF PLANAR GRAPHS WITHOUT 4-CYCLES
    Masarik, T.
    ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 2019, 88 (03): : 935 - 940
  • [35] PACKING AND COVERING OF COMPLETE GRAPH WITH 4-CYCLES
    SCHONHEIM, J
    BIALOSTOCKI, A
    CANADIAN MATHEMATICAL BULLETIN-BULLETIN CANADIEN DE MATHEMATIQUES, 1975, 18 (05): : 703 - 708
  • [36] Decompositions of various complete graphs into isomorphic copies of 4-cycles with three pendant edges
    Abueida, Atif
    Alzahrani, Rabab
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2020, 115 : 187 - 198
  • [37] EXTREMAL GRAPHS WITHOUT 3-CYCLES OR 4-CYCLES
    GARNICK, DK
    KWONG, YHH
    LAZEBNIK, F
    JOURNAL OF GRAPH THEORY, 1993, 17 (05) : 633 - 645
  • [38] Maximum Packings of the Complete Graph with Uniform Length Cycles
    Horsley, Daniel
    JOURNAL OF GRAPH THEORY, 2011, 68 (01) : 1 - 7
  • [39] Decompositions of Various Complete Graphs into Isomorphic Copies of 4-cycles with Three Pendant Edges
    Abueida, Atif
    Alzahrani, Rabab
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2019, 111 : 53 - 64
  • [40] Equitable Δ-Coloring of Planar Graphs without 4-cycles
    Tan, Xiang
    OPERATIONS RESEARCH AND ITS APPLICATIONS, 2010, 12 : 400 - 405