𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Balanced extensions of graphs and hypergraphs

✍ Scribed by A. Rucinski; A. Vince

Publisher
Springer-Verlag
Year
1988
Tongue
English
Weight
599 KB
Volume
8
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On balanced colorings of hypergraphs
On balanced colorings of hypergraphs
✍ A. P. Rozovskaya; M. V. Titova; D. A. Shabanov πŸ“‚ Article πŸ“… 2010 πŸ› Springer US 🌐 English βš– 205 KB
Cohomomorphisms of graphs and hypergraph
Cohomomorphisms of graphs and hypergraphs
✍ Pavol Hell; Jaroslav NeΕ‘etΕ™il πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 547 KB

In addition to a widely studied notion of homomorphisms of graphs and hypergraphs, [2, 5 , 6, 7, 9, 13, 141, we introduce the dual notion of cohomomorphisms. We shall concentrate on only a few aapects of these mappings, mostly with regard to intended applications, [lo, 111. Our basic motivation is t

The solution to an extremal problem on b
The solution to an extremal problem on balanced extensions of graphs
✍ A. RuciΕ„ski; A. Vince πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 694 KB

## Abstract For __n__ sufficiently large the order of a smallest balanced extension of a graph of order __n__ is, in the worst case, ⌊(__n__ + 3)^2^/8βŒ‹. Β© 1993 John Wiley & Sons, Inc.

Balanced graphs and noncovering graphs
Balanced graphs and noncovering graphs
✍ Oliver Pretzel; Dale Youngs πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 532 KB

Pretzel, 0. and D. Youngs, Balanced graphs and noncovering graphs, Discrete Mathematics, 88 (1991) 279-287. Probabilistic arguments show that triangle-free noncovering graphs are very common. Nevertheless, few specific examples are known. In this paper we describe a simple method of constructing a l

On a class of balanced hypergraphs
On a class of balanced hypergraphs
✍ AndrΓ‘s Frank πŸ“‚ Article πŸ“… 1977 πŸ› Elsevier Science 🌐 English βš– 986 KB

Let P be nn arborcscencc, and let F, = {U,, , I/, ). F, = { \y,, . . , V, } bc two systems consisting of directed s&paths of P. MIntmax theorems and algorithms UC proved concerning the so called bi-pcrth system (P; F,,. F, ). One can define a hypqraph to every hi-path system. The class of t hcsc "Ri