CitedEvidence
User Settings
Open AccessArticle10.25596/jalc-2003-659

A Small Embedding for Partial 4-Cycle Systems when the Leave is Small

Charles C. Lindner-2003-01-01-Justus-Liebig-Universität Gießen
3

TL;DRAbstract

In this paper we give an embedding for odd n which improves the best known bound when the "leave" is small. In particular, we prove that a partial 4-cycle system of odd order $n$ with leave consisting of $x$ edges can be embedded in a 4-cycle system of order $n +2x$.

Chat with Paper

AI Agents for this Paper

In this paper we give an embedding for odd n which improves the best known bound when the "leave" is small. In particular, we prove that a partial 4-cycle system of odd order $n$ with leave consisting of $x$ edges can be embedded in a 4-cycle system of order $n +2x$.

Keywords

EmbeddingOrder (exchange)Computer scienceMathematicsCombinatoricsBusinessArtificial intelligence

Chat

Click to start Chat