AbstractLet F be a given graph. A graph G is called F-saturated if F [nsube] G and F ⊆ G + e for every edge e ∉ E(G), e ⊆ V(G). Denote by sat(n, F) the minimum number of edges in an F-saturated graph on n vertices. A conjecture of the second author states that limn→∞ sat(n, F)/n exists for every F. We characterize the case when the limit exists and is smaller than 1
Given a family of graphs F, a graph G is F-saturated if no element of F is a subgraph of G, but for ...
AbstractThe following dual version of Turán's problem is considered: for a given r-uniform hypergrap...
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 F be a given graph. A graph G is called F-saturated if F [nsube] G and F ⊆ G + e for eve...
AbstractA graph G is called Ck-saturated if G contains no cycles of length k but does contain such a...
AbstractA graph G is H-saturated if G does not contain H as a subgraph but for any nonadjacent verti...
AbstractA graph G is said to be F-saturated if G does not contain a copy of F as a subgraph and G+e ...
A graph G is called F-saturated if it is F-free but the addition of any missing edge to G creates a ...
A graph $G$ is said to be \emph{$H$-saturated} if $G$ contains no subgraph isomorphic to $H$ but the...
For a fixed graph $F$, a graph $G$ is said to be $F$-saturated if $G$ does not contain a subgraph is...
A graph G is called \emph{F-saturated} if it is F-free but theaddition of any missing edge to G crea...
AbstractLet G be a graph and F be a family of graphs. We say that G is F-saturated if G does not con...
Let F and H be graphs. A subgraph G of H is an F-saturated subgraph of H if F is not a subgraph of G...
For a fixed graph F, a graph G is F-saturated if there is no copy of F in G, but for any edge e ∉ G,...
AbstractLet P be a hereditary property. Let kP(G) denote the number of forbidden subgraphs, which ar...
Given a family of graphs F, a graph G is F-saturated if no element of F is a subgraph of G, but for ...
AbstractThe following dual version of Turán's problem is considered: for a given r-uniform hypergrap...
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 F be a given graph. A graph G is called F-saturated if F [nsube] G and F ⊆ G + e for eve...
AbstractA graph G is called Ck-saturated if G contains no cycles of length k but does contain such a...
AbstractA graph G is H-saturated if G does not contain H as a subgraph but for any nonadjacent verti...
AbstractA graph G is said to be F-saturated if G does not contain a copy of F as a subgraph and G+e ...
A graph G is called F-saturated if it is F-free but the addition of any missing edge to G creates a ...
A graph $G$ is said to be \emph{$H$-saturated} if $G$ contains no subgraph isomorphic to $H$ but the...
For a fixed graph $F$, a graph $G$ is said to be $F$-saturated if $G$ does not contain a subgraph is...
A graph G is called \emph{F-saturated} if it is F-free but theaddition of any missing edge to G crea...
AbstractLet G be a graph and F be a family of graphs. We say that G is F-saturated if G does not con...
Let F and H be graphs. A subgraph G of H is an F-saturated subgraph of H if F is not a subgraph of G...
For a fixed graph F, a graph G is F-saturated if there is no copy of F in G, but for any edge e ∉ G,...
AbstractLet P be a hereditary property. Let kP(G) denote the number of forbidden subgraphs, which ar...
Given a family of graphs F, a graph G is F-saturated if no element of F is a subgraph of G, but for ...
AbstractThe following dual version of Turán's problem is considered: for a given r-uniform hypergrap...
Given a family of (hyper)graphs F a (hyper)graph G is said to be F-saturated if G is F-free for any ...
DOI
Add to ORKG