A hypergraph H is super-pancyclic if for each A ⊆ V (H) with |A| ≽ 3, H contains a Berge cycle with base vertex set A. We present two natural necessary conditions for a hypergraph to be super-pancyclic, and show that in several classes of hypergraphs these necessary conditions are also sufficient. In particular, they are sufficient for every hypergraph H with δ(H) ≽ max{|V (H)|,|E(H)|+10 4 }. We also consider super-cyclic bipartite graphs: (X, Y )-bigraphs G such that for each A ⊆ X with |A| ≽ 3, G has a cycle CA such that V (CA) ∩ X = A. Super-cyclic graphs are incidence graphs of super-pancyclic hypergraphs, and our proofs use the language of such graphs
AbstractThe notion of hypergraph cyclicity is crucial in numerous fields of application of hypergrap...
International audienceLet $G$ be a graph of order $n$ and $S$ be a set of $s$ vertices. We call $G$,...
AbstractWe show that a strongly connected digraph with n vertices and minimum degree ⩾ n is pancycli...
A hypergraph H is super-pancyclic if for each A ⊆ V (H) with |A| ≽ 3, H contains a Berge cycle with ...
We find Dirac-type sharp sufficient conditions for a hypergraph with few edges to have a hamiltoni...
A graph G on n vertices is said to be pancyclic if it contains cycles of all lengths k for k ∈ {3, ....
A hypertournament or a k-tournament, on n vertices, 2≤k≤n, is a pair T = (V, E), where the vertex se...
Abstract: A hypertournament or a k-tournament, on n vertices, 2kn, is a pair TD (V;E), where the ver...
AbstractLet G be a graph and S a subset of V(G). Let α(S) denote the maximum number of pairwise nona...
Say that a cycle C almost contains a cycle C¯ if every edge except one of C¯ is an edge of C. Call a...
AbstractThe cyclicity of a hypergraph is an efficiently computable integer that extends the notion o...
AbstractLet G be a graph of order n. A graph G is called pancyclic if it contains a cycle of length ...
Several classes of hypergraphs have been defined, or characterised, in terms of cycles. Such a formu...
Let G be a graph on n vertices and let H be a given graph. We say that G is pancyclic, if it contain...
International audienceThe notion of hypergraph cyclicity is crucial in numerous fields of applicatio...
AbstractThe notion of hypergraph cyclicity is crucial in numerous fields of application of hypergrap...
International audienceLet $G$ be a graph of order $n$ and $S$ be a set of $s$ vertices. We call $G$,...
AbstractWe show that a strongly connected digraph with n vertices and minimum degree ⩾ n is pancycli...
A hypergraph H is super-pancyclic if for each A ⊆ V (H) with |A| ≽ 3, H contains a Berge cycle with ...
We find Dirac-type sharp sufficient conditions for a hypergraph with few edges to have a hamiltoni...
A graph G on n vertices is said to be pancyclic if it contains cycles of all lengths k for k ∈ {3, ....
A hypertournament or a k-tournament, on n vertices, 2≤k≤n, is a pair T = (V, E), where the vertex se...
Abstract: A hypertournament or a k-tournament, on n vertices, 2kn, is a pair TD (V;E), where the ver...
AbstractLet G be a graph and S a subset of V(G). Let α(S) denote the maximum number of pairwise nona...
Say that a cycle C almost contains a cycle C¯ if every edge except one of C¯ is an edge of C. Call a...
AbstractThe cyclicity of a hypergraph is an efficiently computable integer that extends the notion o...
AbstractLet G be a graph of order n. A graph G is called pancyclic if it contains a cycle of length ...
Several classes of hypergraphs have been defined, or characterised, in terms of cycles. Such a formu...
Let G be a graph on n vertices and let H be a given graph. We say that G is pancyclic, if it contain...
International audienceThe notion of hypergraph cyclicity is crucial in numerous fields of applicatio...
AbstractThe notion of hypergraph cyclicity is crucial in numerous fields of application of hypergrap...
International audienceLet $G$ be a graph of order $n$ and $S$ be a set of $s$ vertices. We call $G$,...
AbstractWe show that a strongly connected digraph with n vertices and minimum degree ⩾ n is pancycli...