Related papers: Short cycle covers of cubic graphs and intersectin…
How many edges in an $n$-vertex graph will force the existence of a cycle with as many chords as it has vertices? Almost 30 years ago, Chen, Erd\H{o}s and Staton considered this question and showed that any $n$-vertex graph with $2n^{3/2}$…
The perfect matching index of a cubic graph $G$, denoted by $\pi(G)$, is the smallest number of perfect matchings that cover all the edges of $G$. According to the Berge-Fulkerson conjecture, $\pi(G)\le5$ for every bridgeless cubic…
In this work, we study conditions for the existence of length-constrained path-cycle decompositions, that is, partitions of the edge set of a graph into paths and cycles of a given minimum length. Our main contribution is the…
An acyclic set in a digraph is a set of vertices that induces an acyclic subgraph. In 2011, Harutyunyan conjectured that every planar digraph on $n$ vertices without directed 2-cycles possesses an acyclic set of size at least $3n/5$. We…
The edges surrounding a face of a map $M$ form a cycle $C$, called the boundary cycle of the face, and $C$ is often not a simple cycle. If the map $M$ is arc-transitive, then there is a cyclic subgroup of automorphisms of $M$ which leaves…
An old conjecture of Erd{\H{o}}s and Gallai states that every $n$ vertex graph can be decomposed, that is $E(G)$ can be partitioned, into $O(n)$ cycles and edges. The covering version of this conjecture was proven by Pyber in 1985, where it…
Dirac proved that any graph with minimum vertex degree $\delta$ contains either a cycle of length at least $2\delta$ or a Hamilton cycle. Motivated by this result, we characterize those graphs having no cycle longer than $2\delta$.
In 1979 Babai found a clever argument to prove that every connected vertex transitive graph on $n \ge 3$ vertices contains a cycle of length at least $\sqrt{3n}$. Here we modify his approach to show that such graphs must contain a cycle of…
We construct a countable infinite graph G that does not contain cycles of length four having the property that the sequence of graphs $G_n$ induced by the first $n$ vertices has minimum degree $\delta(G_n)> n^{\sqrt{2}-1+o(1)}$.
A $k$-uniform tight cycle is a $k$-graph with a cyclic order of its vertices such that every $k$ consecutive vertices from an edge. We show that for $k\geq 3$, every red-blue edge-coloured complete $k$-graph on $n$ vertices contains $k$…
One way to certify that a graph does not contain an induced cycle of length six is to provide a partition of its vertex set into (i) a stable set, and (ii) a graph containing no stable set of size three and no induced matching of size two.…
This note provides a complete solution to a certain version of the edge-isoperimetric problem for powers of a cycle graph. Namely, it shows that the maximum number of edges inside a vertex subset of $C_n^s$ of size $k$ is achieved by a set…
Let $\rho(G)$ denote the number of convex cycles of a simple graph G of order n, size m, and girth 3 <= g <=n. It is proved that $\rho(G) \leq \frac{n}{g}(m-n+1)$ and that equality holds if and only if G is an even cycle or a Moore graph.…
The Berge-Fulkerson conjecture states that every bridgeless cubic graph can be covered with six perfect matchings such that each edge is covered exactly twice. An equivalent reformulation is that it's possible to find a 6-cycle 4-cover. In…
A graph is said to be cyclic $k$-edge-connected, if at least $k$ edges must be removed to disconnect it into two components, each containing a cycle. Such a set of $k$ edges is called a cyclic-$k$-edge cutset and it is called a trivial…
Let $G$ be a graph. A total dominating set in a graph $G$ is a set $S$ of vertices of $G$ such that every vertex in $G$ is adjacent to a vertex in $S$. Recently, the following question was proposed: "Is it true that every connected cubic…
We show that if X is a minimal length carrier graph in a hyperbolic 3-manifold, M, then if X contains a sufficiently short edge, it must contain a short circuit, as well. The meaning of "short" depends only on the rank of the fundamental…
Using closure concepts, we show that within every undirected network, or graph, there is a unique irreducible subgraph which we call its "spine". The chordless cycles which comprise this irreducible core effectively characterize the…
In this paper, we obtain explicit formulae for the number of 7-cycles and the total number of paths of lengths 6 and 7 those contain a specific vertex $v_{i}$ in a simple graph G, in terms of the adjacency matrix and with the help of…
We show that every planar, 4-connected, K2;5-minor- free graph is the square of a cycle of even length at least six.