Divisible subdivisions
Copyright policy )Divisible subdivisions
AbstractWe prove that for every graph of maximum degree at most 3 and for every positive integer there is a finite such that every ‐minor contains a subdivision of in which every edge is replaced by a path whose length is divisible by . For the case of cycles we show that for every ‐minor contains a cycle of length divisible by , and observe that this settles a recent problem of Friedman and the second author about cycles in (weakly) expanding graphs.
- College of New Jersey United States
- Tel Aviv University Israel
Distance in graphs, subdivisions, cycles, Graph minors, FOS: Mathematics, Mathematics - Combinatorics, divisibility, Combinatorics (math.CO), complete minors, Paths and cycles, expanders, 05C53, 05C83, 05C38
Distance in graphs, subdivisions, cycles, Graph minors, FOS: Mathematics, Mathematics - Combinatorics, divisibility, Combinatorics (math.CO), complete minors, Paths and cycles, expanders, 05C53, 05C83, 05C38
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).9 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!