✦ LIBER ✦

On the Maximum Number of Cyclic Triples in Oriented Graphs

✍ Scribed by Lowell W. Beineke; Frank Harary

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 146 KB
Volume: 81
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.2000.1995

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the maximum number of cycles in a pla

On the maximum number of cycles in a planar graph

✍ R. E. L. Aldred; Carsten Thomassen 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 2 views

## Abstract Let __G__ be a graph on __p__ vertices with __q__ edges and let __r__ = __q__ − __p__ = 1. We show that __G__ has at most ${15\over 16} 2^{r}$ cycles. We also show that if __G__ is planar, then __G__ has at most 2^__r__ − 1^ = __o__(2^__r__ − 1^) cycles. The planar result is best possib

On the Maximum Number of Independent Cyc

On the Maximum Number of Independent Cycles in a Bipartite Graph

✍ Hong Wang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 404 KB

Let G=(V 1 , V 2 ; E ) be a bipartite graph with |V 1 |= |V 2 | =n 2k, where k is a positive integer. Suppose that the minimum degree of G is at least k+1. We show that if n>2k, then G contains k vertex-disjoint cycles. We also show that if n=2k, then G contains k&1 quadrilaterals and a path of orde

On the asymptotic behavior of the maximu

On the asymptotic behavior of the maximum number of spanning trees in circulant graphs

✍ Lonc, Zbigniew; Parol, Krzysztof; Wojciechowski, Jacek M. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 3 views

The following asymptotic estimation of the maximum number of spanning trees f k (n) in 2kregular circulant graphs ( k ú 1) on n vertices is the main result of this paper: )) , where

On the Number of Nonisomorphic Orientabl

On the Number of Nonisomorphic Orientable Regular Embeddings of Complete Graphs

✍ Vladimir P. Korzhik; Heinz-Jurgen Voss 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 260 KB

In this paper we consider those 2-cell orientable embeddings of a complete graph K n+1 which are generated by rotation schemes on an abelian group 8 of order n+1, where a rotation scheme an 8 is defined as a cyclic permutation ( ; 1 , ; 2 , ..., ; n ) of all nonzero elements of 8. It is shown that t

On arcs sharing the maximum number of po

On arcs sharing the maximum number of points with ovals in cyclic affine planes of odd order

✍ Gábor Korchmáros; Angelo Sonnino 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 187 KB 👁 2 views

## Abstract The sporadic complete 12‐arc in PG(2, 13) contains eight points from a conic. In PG(2,__q__) with __q__>13 odd, all known complete __k__‐arcs sharing exactly ½(__q__+3) points with a conic 𝒞 have size at most ½(__q__+3)+2, with only two exceptions, both due to Pellegrino, which are comp

Bounding the crossing number of a graph

Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree

✍ Enrique Garcia-Moreno; Gelasio Salazar 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 76 KB 👁 3 views