✦ LIBER ✦

On a conjecture of Aris: Proof and remarks

✍ Scribed by Dan Luss; Neal R. Amundson

Publisher: American Institute of Chemical Engineers
Year: 1967
Tongue: English
Weight: 428 KB
Volume: 13
Category: Article
ISSN: 0001-1541
DOI: 10.1002/aic.690130431

No coin nor oath required. For personal study only.

📜 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

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

Squaring a tournament: A proof of Dean's

Squaring a tournament: A proof of Dean's conjecture

✍ Fisher, David C. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 1 views

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

Two Proof-Theoretic Remarks on EA + ECT

✍ Volker Halbach; Leon Horsten 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB 👁 1 views

On a conjecture of Thomassen and Toft

✍ Kriesell, Matthias 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB 👁 2 views

This article is motivated by a conjecture of Thomassen and Toft on the number s 2 (G) of separating vertex sets of cardinality 2 and the number v 2 (G) of vertices of degree 2 in a graph G belonging to the class G of all 2-connected graphs without nonseparating induced cycles. Let G denote the numbe

On a Conjecture of Kleene and Post

✍ S. Barry Cooper 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 377 KB 👁 2 views