𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Extremals of functions on graphs with applications to graphs and hypergraphs

✍ Scribed by Vera T Sós; E.G Straus

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
488 KB
Volume
32
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On splittable colorings of graphs and hy
On splittable colorings of graphs and hypergraphs
✍ Zoltán Füredi; Radhika Ramamurthi 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB

## Abstract The notion of a split coloring of a complete graph was introduced by Erdős and Gyárfás [7] as a generalization of split graphs. In this work, we offer an alternate interpretation by comparing such a coloring to the classical Ramsey coloring problem via a two‐round game played against an

On the orientation of graphs and hypergr
On the orientation of graphs and hypergraphs
✍ András Frank; Tamás Király; Zoltán Király 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 198 KB

Graph orientation is a well-studied area of combinatorial optimization, one that provides a link between directed and undirected graphs. An important class of questions that arise in this area concerns orientations with connectivity requirements. In this paper we focus on how similar questions can b

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

Applications of hypergraph coloring to c
Applications of hypergraph coloring to coloring graphs not inducing certain trees
✍ H.A. Kierstead; V. Rodl 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 385 KB

We present a simple result on coloring hypergraphs and use it to obtain bounds on the chromatic number of graphs which do not induce certain trees. ## O. Introduction A class of graphs F is said to be x-bounded if there exists a functionfsuch that for all graphs G e F, (.) z(G) <~f(og(G)), where