✦ LIBER ✦

A class of multicriterial problems on graphs and hypergraphs

✍ Scribed by V. A. Perepelitsa

Publisher: Springer US
Year: 1984
Tongue: English
Weight: 647 KB
Volume: 20
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01068929

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Solving Problems on Special Classes of G

Solving Problems on Special Classes of Graphs

✍ Vijay Raghavan; Jeremy P. Spinrad 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 210 KB

Minimizer graphs for a class of extremal

Minimizer graphs for a class of extremal problems

✍ Dan Ismailescu; Dan Stefanica 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB 👁 2 views

## Abstract We consider the family of graphs with a fixed number of vertices and edges. Among all these graphs, we are looking for those minimizing the sum of the square roots of the vertex degrees. We prove that there is a unique such graph, which consists of the largest possible complete subgraph