Add to ORKGAgraphG is said to be Cl-saturated if G contains no cycle of length l, but for any edge in the complement of G the graph G + e does contain a cycle of length l. The minimum number of edges of a Cl-saturated graph was shown by Barefoot et al. to be between n + c1 n l confirmed a conjecture of Bollobás.Hereweimprovethevalueofc2for l ≥ 8. and n + c2 n l for some positive constants c1 and c2. This the electronic journal of combinatorics 13 (2006), #R29 1
Let H be a graph. If G is an n-vertex simple graph that does not contain H as a minor, what is the m...
Let Qd denote the hypercube of dimension d. Given d ≥ m, a spanning subgraph G of Qd is said to be (...
We say G is (Qn, Qm)-saturated if it is a maximal Qm-free subgraph of the n-dimensional hypercube Qn...
AbstractA graph G is called Ck-saturated if G contains no cycles of length k but does contain such a...
Abstract A graph is said to be Ck-saturated if it contains no cycles of length k but does contain su...
AbstractA graph G is said to be F-saturated if G does not contain a copy of F as a subgraph and G+e ...
AbstractLet F be a given graph. A graph G is called F-saturated if F [nsube] G and F ⊆ G + e for eve...
© 2021 Society for Industrial and Applied Mathematics.This paper considers an edge minimization prob...
Given a family of (hyper)graphs F a (hyper)graph G is said to be F-saturated if G is F-free for any ...
AbstractLet Gn be a class of graphs on n vertices. For an integer c, let ex(Gn,c) be the smallest in...
AbstractLet P be a hereditary property. Let kP(G) denote the number of forbidden subgraphs, which ar...
AbstractLet ƒ(n) be the maximum number of edges in a graph on n vertices in which no two cycles have...
A graph G is said to be H-saturated if G is H-free i.e., (G has no subgraph isomorphic to H) and add...
Given a family of graphs F, a graph G is F-saturated if no element of F is a subgraph of G, but for ...
For a hereditary property P let kP(G) denote the number of for-bidden subgraphs contained in G. A gr...
Let H be a graph. If G is an n-vertex simple graph that does not contain H as a minor, what is the m...
Let Qd denote the hypercube of dimension d. Given d ≥ m, a spanning subgraph G of Qd is said to be (...
We say G is (Qn, Qm)-saturated if it is a maximal Qm-free subgraph of the n-dimensional hypercube Qn...
AbstractA graph G is called Ck-saturated if G contains no cycles of length k but does contain such a...
Abstract A graph is said to be Ck-saturated if it contains no cycles of length k but does contain su...
AbstractA graph G is said to be F-saturated if G does not contain a copy of F as a subgraph and G+e ...
AbstractLet F be a given graph. A graph G is called F-saturated if F [nsube] G and F ⊆ G + e for eve...
© 2021 Society for Industrial and Applied Mathematics.This paper considers an edge minimization prob...
Given a family of (hyper)graphs F a (hyper)graph G is said to be F-saturated if G is F-free for any ...
AbstractLet Gn be a class of graphs on n vertices. For an integer c, let ex(Gn,c) be the smallest in...
AbstractLet P be a hereditary property. Let kP(G) denote the number of forbidden subgraphs, which ar...
AbstractLet ƒ(n) be the maximum number of edges in a graph on n vertices in which no two cycles have...
A graph G is said to be H-saturated if G is H-free i.e., (G has no subgraph isomorphic to H) and add...
Given a family of graphs F, a graph G is F-saturated if no element of F is a subgraph of G, but for ...
For a hereditary property P let kP(G) denote the number of for-bidden subgraphs contained in G. A gr...
Let H be a graph. If G is an n-vertex simple graph that does not contain H as a minor, what is the m...
Let Qd denote the hypercube of dimension d. Given d ≥ m, a spanning subgraph G of Qd is said to be (...
We say G is (Qn, Qm)-saturated if it is a maximal Qm-free subgraph of the n-dimensional hypercube Qn...