𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The end structure of a graph: recent results and open problems

✍ Scribed by Reinhard Diestel

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
1022 KB
Volume
100
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

This paper aims to give a brief introduction to a set of problems, old and new, concerned with one of the main and long-standing quests in infinite graph theory: how to represent the end structure of a given graph by that of a simpler subgraph, in particular a spanning tree. There has been a fair amount of activity in this field recently; we describe the latest results, as well as some of the new problems which these results suggest.

πŸ“œ SIMILAR VOLUMES

A survey: Recent results, conjectures, a
A survey: Recent results, conjectures, and open problems in labeling graphs
✍ Joseph A. Gallian πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 752 KB

In this paper we organize and summarize much of the work done on graceful and harmonious labelings of graphs. Many open problems and conjectures are included.

On the Ramsey multiplicities of graphsβ€”p
On the Ramsey multiplicities of graphsβ€”problems and recent results
✍ Stefan A. Burr; Vera Rosta πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 610 KB

## Abstract Ramsey's theorem guarantees that if __G__ is a graph, then any 2‐coloring of the edges of a large enough complete graph yields a monochromatic copy of __G__. Interesting problems arise when one asks how many such __G__ must occur. A survey of this and related problems is given, along wi

Digraph extremal problems, hypergraph ex
Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
✍ W.G Brown; M Simonovits πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 747 KB

We consider extremal problems 'of Tur~ type' for r-uniform ordered hypergraphs, where multiple oriented edges are permitted up to multiplicity q. With any such '(r, q)-graph' G" we associate an r-linear form whose maximum over the standard (n -1)-simplex in R" is called the (graph-) density g(G ") o

The A4-structure of a graph
The A4-structure of a graph
✍ Michael D. Barrus; Douglas B. West πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 215 KB
Recent results in the investigation of t
Recent results in the investigation of the structure of the gluten complex
✍ LΓ‘sztity, R. πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 473 KB

Recent results in the investigation of the structure of the gluten complex R. Lkszriru I t is generally accepted that gluten complex is composed from different groups of proteins bound by covalent and non covalent system of bonds resp. interactions. The two main groups of those are low molecular wei