𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some minimax problems for graphs

✍ Scribed by Miroslav Fiedler

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
462 KB
Volume
121
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Fiedler, M., Some minimax problems for graphs, Discrete Mathematics 121 (1993) 65-74.

If a characteristic of a simple graph G allows an extension to nonnegative edge valuations of G, the corresponding absolute characteristic is defined as the extreme of the characteristic over all nonnegative edge valuations of G with an average value of 1. A survey of the results for previously studied cases is given and new results on the absolute algebraic connectivity, absolute diameter and absolute radius of a tree are added.

πŸ“œ SIMILAR VOLUMES

A note on some embedding problems for or
A note on some embedding problems for oriented graphs
✍ Andrew Treglown πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 88 KB

We conjecture that every oriented graph G on n vertices with + (G), -(G) β‰₯ 5n / 12 contains the square of a Hamilton cycle. We also give a conjectural bound on the minimum semidegree which ensures a perfect packing of transitive triangles in an oriented graph. A link between Ramsey numbers and perfe

Some problems in topological graph theor
Some problems in topological graph theory
✍ Jonathan L. Gross; Frank Harary πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English

## Abstract A list of 31 problems presented here reflects some of the main trends in topological graph theory.

On some extremal problems on r-graphs
On some extremal problems on r-graphs
✍ P. ErdΓΆs πŸ“‚ Article πŸ“… 1971 πŸ› Elsevier Science 🌐 English βš– 499 KB

Abslract. Denote by @)(n; k) an ~-graph of n vcrtieca and k r-tuples. Turin's classical problem states: Detomline the smailcst integer f(n;r, I) so that cvcry G%; f(n; r, I)) contains a K@)(I). Tur&n determined f (n; r, I) for r = 2, but nothing is known for r > ?. Put lim,,f(n; t, O/(y) = c,,~ The

A minimax theorem for infinite graphs wi
A minimax theorem for infinite graphs with ideal points
✍ Norbert Polat πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 617 KB

Polat, N., A minimax theorem for infinite graphs with ideal points, Discrete Mathematics 103 (1992) 57-65. Let d be a family of sets of ends of an infinite graph, having the property that every element of any member of 1 can be separated from the union of all other members by a finite set of vertice