✦ LIBER ✦

Squaring a tournament: A proof of Dean's conjecture

✍ Scribed by Fisher, David C.

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 310 KB
Volume: 23
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199609)23:1<43::aid-jgt4>3.0.co;2-k

No coin nor oath required. For personal study only.

✦ Synopsis

Let the square of a tournament be the digraph on the same nodes with arcs where the directed distance in the tournament is at most two. This paper verifies Dean's conjecture: any tournament has a node whose outdegree is at least doubled in its square. 0

📜 SIMILAR VOLUMES

Proof of a conjecture of Alan Hartman

✍ Liu, Q. Z.; Yap, H. P. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 265 KB 👁 1 views

A tree T is said to be bad, if it is the vertex-disjoint union of two stars plus an edge joining the center of the first star to an end-vertex of the second star. A tree T is good, if it is not bad. In this article, we prove a conjecture of Alan Hartman that, for any spanning tree T of K 2m , where

On a conjecture of Aris: Proof and remar

On a conjecture of Aris: Proof and remarks

✍ Dan Luss; Neal R. Amundson 📂 Article 📅 1967 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 428 KB 👁 2 views

Proof of a conjecture on cycles in a bip

Proof of a conjecture on cycles in a bipartite graph

✍ Wang, Hong 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB 👁 2 views

It was conjectured in [Wang, to appear in The Australasian Journal of Combinatorics] that, for each integer k ≥ 2, there exists . This conjecture is also verified for k = 2, 3 in [Wang, to appear; Wang, manuscript]. In this article, we prove this conjecture to be true if n ≥ 3k, i.e., M (k) ≤ 3k. W

Median orders of tournaments: A tool for

Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture

✍ Frédéric Havet; Stéphan Thomassé 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

A simple proof of Moser's theorem

✍ Zhu, Xuding 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB 👁 2 views

This article gives a simple proof of a result of Moser, which says that, for any rational number r between 2 and 3, there exists a planar graph G whose circular chromatic number is equal to r.

A note on possible extensions of Negami'

A note on possible extensions of Negami's conjecture

✍ Hlin?n�, Petr 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 239 KB 👁 2 views

A graph H is a cover of a graph G, if there exists a mapping ϕ from V (H) onto V (G) such that for every vertex v of G, ϕ maps the neighbors of v in H bijectively onto the neighbors of ϕ(v) in G. Negami conjectured in 1987 that a connected graph has a finite planar cover if and only if it embeds in