𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Supersaturated graphs and hypergraphs

✍ Scribed by Paul Erdős; Miklós Simonovits

Book ID
110564339
Publisher
Springer-Verlag
Year
1983
Tongue
English
Weight
499 KB
Volume
3
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Indecomposable regular graphs and hyperg
Indecomposable regular graphs and hypergraphs
✍ Zoltán Füredi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 390 KB

Ftiredi, Z&an, Indecomposable regular graphs and hypergraphs, Discrete Mathematics 101 (1992) 59-64. Let G be a d-regular simple graph with n vertices. Here it is proved that for d > 6 -1, G contains a proper regular spanning subhypergraph. The same statement is proved for multigraphs with d > (n -1

Graph properties and hypergraph colourin
Graph properties and hypergraph colourings
✍ Jason I. Brown; Derek G. Corneil 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 855 KB

Given a graph property P, graph G and integer k 20, a P k-colouring of G is a function Jr:V(G)+ (1,. . ) k} such that the subgraph induced by each colour class has property P. When P is closed under induced subgraphs, we can construct a hypergraph HG such that G is P k-colourable iff Hg is k-colou