Tight bounds for divisible subdivisions

被引：1
|
作者：
Das, Shagnik [1 ]
Draganic, Nemanja [2 ]
Steiner, Raphael [3 ]
机构：
[1] Natl Taiwan Univ, Dept Math, Taipei, Taiwan
[2] Swiss Fed Inst Technol, Dept Math, Zurich, Switzerland
[3] Swiss Fed Inst Technol, Inst Theoret Comp Sci, Zurich, Switzerland
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES B | 2024年 / 165卷
关键词：
ZERO; GRAPHS; SYSTEMS; NUMBERS; MINORS; TURAN;
D O I：
10.1016/j.jctb.2023.10.011
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Alon and Krivelevich proved that for every n-vertex subcubic graph H and every integer q >= 2 there exists a (smallest) integer f = f(H, q) such that every Kf-minor contains a subdivision of H in which the length of every subdivision-path is divisible by q. Improving their superexponential bound, we show that f(H, q) <= 212 qn + 8n + 14q, which is optimal up to a constant multiplicative factor. (c) 2023 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY license (http:// creativecommons .org /licenses /by /4 .0/).
引用
收藏
页码：1 / 19
页数：19
相关论文
共 50 条
  • [1] Divisible subdivisions
    Alon, Noga
    Krivelevich, Michael
    [J]. JOURNAL OF GRAPH THEORY, 2021, 98 (04) : 623 - 629
  • [2] Lower bounds for kinetic planar subdivisions
    Agarwal, PK
    Basch, J
    de Berg, M
    Guibas, LJ
    Hershberger, J
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2000, 24 (04) : 721 - 733
  • [3] Improved bounds for the extremal number of subdivisions
    Janzer, Oliver
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2019, 26 (03):
  • [4] Lower Bounds for Kinetic Planar Subdivisions
    P. K. Agarwal
    J. Basch
    M. de Berg
    J. L. J. Guibas
    [J]. Discrete & Computational Geometry, 2000, 24 : 721 - 733
  • [5] Asymptotic bounds for infinitely divisible sequences
    Kwapien, Stanislaw
    Rosinski, Jan
    [J]. STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 2006, 116 (11) : 1622 - 1635
  • [6] On Tight Bounds for the Lasso
    van de Geer, Sara
    [J]. JOURNAL OF MACHINE LEARNING RESEARCH, 2018, 19
  • [7] Tight bounds on plurality
    Srivastava, N
    Taylor, AD
    [J]. INFORMATION PROCESSING LETTERS, 2005, 96 (03) : 93 - 95
  • [8] TIGHT BOUNDS FOR CAPACITIES
    KAMPKE, T
    [J]. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1994, 27 (08) : 67 - 86
  • [9] Equiangular tight frames from group divisible designs
    Matthew Fickus
    John Jasper
    [J]. Designs, Codes and Cryptography, 2019, 87 : 1673 - 1697
  • [10] ERROR BOUNDS OF GALERKIN PROJECTIONS ON SPLINES WITH NONUNIFORM SUBDIVISIONS
    GUSMANN, B
    [J]. ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK, 1979, 59 (03): : T61 - T62
12345