Minimal bricks have many vertices of small degree
نویسندگان
چکیده
منابع مشابه
Minimal bricks have many vertices of small degree
We prove that every minimal brick on n vertices has at least n/9 vertices of degree at most 4.
متن کاملMinimal bricks
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletion of e results in a graph that is not a brick. We prove a generation theorem for minimal bricks and two corollaries: (1) for n ≥ 5, every minimal brick on 2n vertices has at most 5n − 7 edges, and (2) every minimal br...
متن کاملMinimal Free Resolutions of Projective Subschemes of Small Degree
For an arbitrary projective subscheme X ⊂ P, it is impossible to say much about its minimal free resolution. Some a priori information is needed. In this article we will consider integral subschemes as well as equidimensional Cohen-Macaulay subschemes of small degree. There are several encouraging results for such subschemes in the literature. Our goal is to discuss the known results and to mot...
متن کاملCycles containing all vertices of maximum degree
For a graph Gand an integer k, denote by Vk the set {u E V(G) I d(u) 2 k}. Veldman proved that if G is a 2-connected graph of order n with n 5 3k 2 and IVkl 5 k, then G has a cycle containing all vertices of Vk. It is shown that the upper bound k on IVkl is close to best possible in general. For the special case k = A(G), it is conjectured that the condition lVkl I k can be omitted. Using a var...
متن کاملMany-to-many disjoint paths in hypercubes with faulty vertices
This paper considers the problemofmany-to-many disjoint paths in the hypercubeQn with f faulty vertices and obtains the following result. For any integer k with 1 ≤ k ≤ n − 1 and any two sets S and T of k fault-free vertices in different partite sets of Qn (n ≥ 2), if f ≤ 2n−2k−2 and each fault-free vertex has at least two fault-free neighbors, then there exist k fully disjoint fault-free paths...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2014
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2013.06.045