𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An extremal problem for paths in bipartite graphs

✍ Scribed by A. Gyárfás; C. C. Rousseau; R. H. Schelp

Publisher
John Wiley and Sons
Year
1984
Tongue
English
Weight
621 KB
Volume
8
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An extremal bandwidth problem for bipart
An extremal bandwidth problem for bipartite graphs
✍ Robert C. Brigham; Julie R. Carrington; Ronald D. Dutton; Joseph Fiedler; Richar 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB 👁 2 views
An extremal problem for H-linked graphs
An extremal problem for H-linked graphs
✍ Alexandr Kostochka; Gexin Yu 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB 👁 1 views

## Abstract We introduce the notion of __H__‐linked graphs, where __H__ is a fixed multigraph with vertices __w__~1~,…,__w__~m~. A graph __G__ is __H__‐__linked__ if for every choice of vertices υ~1~,…, υ~m~ in __G__, there exists a subdivision of __H__ in __G__ such that υ~i~ is the branch vertex

An extremal problem on Kr-free graphs
An extremal problem on Kr-free graphs
✍ Peter Frankl; János Pach 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB 👁 2 views

Let r, t 2 2 be integers and c a constant, 0 < c 5 ( r -2 ) / ( r -1). Suppose that G is a &-free graph on n vertices in which any t distinct vertices have at most cn common neighbors. Here an asymptotically best bound is obtained for the maximal number of edges in such graphs. This solves a problem

Longest paths and cycles in bipartite or
Longest paths and cycles in bipartite oriented graphs
✍ Zhang Ke Min 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 430 KB 👁 1 views

In this paper we obtain two sufficient conditions, Ore type (Theorem 1) and Dirac type (Theorem 2). on the degrees of a bipartite oriented graph for ensuring the existence of long paths and cycles. These conditions are shown to be the best possible in a sense. An oriented graph is a digraph without

Paths in bipartite graphs with color-inv
Paths in bipartite graphs with color-inverting involutions
✍ Gert Sabidussi 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 681 KB

We consider connected bipartite graphs that have a color-inverting involution and do not contain an induced path of length 5. It is shown that such graphs have a color-preserving involution or a dominating edge, or else contain one of two simple forbidden subgraphs.