Minimum number of edges in graphs that are both P2- and Pi-connected
نویسندگان
چکیده
منابع مشابه
On the extremal number of edges in hamiltonian connected graphs
Assume that n and δ are positive integers with 3 ≤ δ < n. Let hc(n, δ) be the minimum number of edges required to guarantee ann-vertex graphGwithminimumdegree δ(G) ≥ δ to be hamiltonian connected. Any n-vertex graphGwith δ(G) ≥ δ is hamiltonian connected if |E(G)| ≥ hc(n, δ). We prove that hc(n, δ) = C(n − δ + 1, 2) + δ2 − δ + 1 if δ ≤ b n+3×(n mod 2) 6 c+1,hc(n, δ) = C(n−b n 2 c+1, 2)+b n 2 c ...
متن کاملThe number of edges in critical strongly connected graphs
We prove that the maximal number of directed edges in a vertex-critical strongly connected simple digraph on n vertices is (
متن کاملMinimum number of edges that occur in odd cycles
If a graph G has n ≥ 4k vertices and more than n/4 edges, then it contains a copy of C2k+1. In 1992, Erdős, Faudree and Rousseau showed even more, that the number of edges that occur in a triangle of such a G is at least 2 bn/2c+ 1, and this bound is tight. They also showed that the minimum number of edges in G that occur in a copy of C2k+1 for k ≥ 2 suddenly starts being quadratic in n, and co...
متن کاملCycle-Saturated Graphs with Minimum Number of Edges
A graph G is called F -saturated if it does not contain any copy of F , but for any edge e in the complement of G the graph G + e contains some F . The minimum size of an n-vertex F -saturated graph is denoted by sat(n, F ). We give almost exact asymptotics for sat(n,Ck) as k is fixed and n → ∞ where Ck is a cycle with length k.
متن کاملThe Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and Edges
Let c(n, q) be the number of connected labeled graphs with n vertices and q 5 N = ( ) edges. Let x = q/n and k = q n. We determine functions w k 1 , a(x ) and cp(x) such that c (n , q) w k ( z ) e n r p ( x ) e o ( x ) uniformly for all n and q 2 n. If Q > O is fixed, n+= and 4q > ( 1 + ~ ) n log n, this formula simplifies to c(n, q) ( t ) exp(-ne-zq’n). On the other hand, if k = o(n”’), this f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1983
ISSN: 0012-365X
DOI: 10.1016/0012-365x(83)90060-2