Large Monotone Paths in Graphs with Bounded Degree
نویسندگان
چکیده
منابع مشابه
Large Monotone Paths in Graphs with Bounded Degree
We prove that for every > 0 and positive integer r, there exists ∆0 = ∆0( ) such that if ∆ > ∆0 and n > n(∆, , r) then there exists a packing of Kn with b(n − 1)/∆c graphs, each having maximum degree at most ∆ and girth at least r, where at most n edges are unpacked. This result is used to prove the following: Let f be an assignment of real numbers to the edges of a graph G. Let α(G, f) denote ...
متن کاملLarge 2P3-free graphs with bounded degree
Let ex (D; H) be the maximum number of edges in a connected graph with maximum degree D and no induced subgraph H; this is nite if and only if H is a disjoint union of paths. If the largest component of such an H has order m, then ex (D; H) = O(D 2 ex (D; P m)). Constructively, ex (D; qP m) = (qD 2 ex (D; P m)) if q > 1 and m > 2 (((qD 2) if m = 2). For H = 2P 3 (and D 8), the maximum number of...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملLarge Bounded Degree Trees in Expanding Graphs
A remarkable result of Friedman and Pippenger [4] gives a sufficient condition on the expansion properties of a graph to contain all small trees with bounded maximum degree. Haxell [5] showed that under slightly stronger assumptions on the expansion rate, their technique allows one to find arbitrarily large trees with bounded maximum degree. Using a slightly weaker version of Haxell’s result we...
متن کاملCycles and paths in graphs with large minimal degree
Let G be a simple graph of order n and minimal degree > cn (0 < c < 1=2). We prove that (1) There exist n0 1⁄4 n0(c) and k 1⁄4 k(c) such that if n > n0 and G contains a cycle Ct for some t > 2k ; then G contains a cycle Ct 2s for some positive s < k ; (2) Let G be 2-connected and nonbipartite. For each " (0 < " < 1), there exists n0 1⁄4 n0(c; ") such that if n n0 then G contains a cycle Ct for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2001
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s003730170031