Back to Search
Start Over
Conditions for a bigraph to be super-cyclic
- Publication Year :
- 2020
- Publisher :
- arXiv, 2020.
-
Abstract
- A hypergraph $\mathcal H$ is super-pancyclic if for each $A \subseteq V(\mathcal H)$ with $|A| \geq 3$, $\mathcal 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 for this. In particular, they are sufficient for every hypergraph $\mathcal H$ with $ \delta(\mathcal H)\geq \max\{|V(\mathcal H)|, \frac{|E(\mathcal H)|+10}{4}\}$. We also consider super-cyclic bipartite graphs: those are $(X,Y)$-bigraphs $G$ such that for each $A \subseteq X$ with $|A| \geq 3$, $G$ has a cycle $C_A$ such that $V(C_A)\cap X=A$. Such graphs are incidence graphs of super-pancyclic hypergraphs, and our proofs use the language of such graphs.<br />Comment: 17 pages
- Subjects :
- Vertex (graph theory)
Hypergraph
Mathematics::Combinatorics
Applied Mathematics
Bigraph
Theoretical Computer Science
Combinatorics
Base (group theory)
Computational Theory and Mathematics
Computer Science::Discrete Mathematics
Bipartite graph
FOS: Mathematics
Mathematics - Combinatorics
Discrete Mathematics and Combinatorics
Geometry and Topology
Combinatorics (math.CO)
Incidence (geometry)
Mathematics
Subjects
Details
- Database :
- OpenAIRE
- Accession number :
- edsair.doi.dedup.....7c0a3c389e7b88beb979b5b0d5850e78
- Full Text :
- https://doi.org/10.48550/arxiv.2006.15730