✦ LIBER ✦

The maximum number of arc-disjoint arborescences in a tournament

✍ Scribed by Ma Chung-fan; Cai Mao-cheng

Publisher: John Wiley and Sons
Year: 1982
Tongue: English
Weight: 225 KB
Volume: 6
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190060305

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

In this article, we give the maximum number of arc‐disjoint arborescences in a tournament or an oriented complete r‐partite graph by means of the indegrees of its vertices.

📜 SIMILAR VOLUMES

The number of pancyclic arcs in a k-stro

The number of pancyclic arcs in a k-strong tournament

✍ Anders Yeo 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB

## Abstract A __tournament__ is a digraph, where there is precisely one arc between every pair of distinct vertices. An arc is __pancyclic__ in a digraph __D__, if it belongs to a cycle of length __l__, for all 3 ≤ __l__ ≤ |__V__ (__D__) |. Let __p__(__D__) denote the number of pancyclic arcs in a

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

## 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

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

## 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

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 👁 2 views

On the maximum number of edges in a c4-f

On the maximum number of edges in a c4-free subgraph of qn

✍ Peter Brass; Heiko Harborth; Hauke Nienborg 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 283 KB 👁 1 views

For the maximum number f ( n ) of edges in a C4-free subgraph of the n-dimensional cube-graph 0, w e prove f(n) 2 i ( n + f i ) 2 " -' for n = 4f, and f ( n ) 2 i ( n + 0.9,h)2"-' for all n 2 9. This disproves one version of a conjecture of P. Erdos.

Short note: Estimating the number of pur

Short note: Estimating the number of pure chemical components in a mixture by maximum likelihood

✍ Edmund R. Malinowski 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 56 KB 👁 1 views

## Abstract Computations attributed to the Malinowski __F__‐test are incorrect because they were based on determining the equality of secondary eigenvalues instead of the equality of reduced eigenvalues as prescribed in the original work of Malinowski. When the correct expression was employed, the