𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the construction of 3-chromatic hypergraphs with few edges

✍ Scribed by Gebauer, Heidi

Book ID
120297014
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
245 KB
Volume
120
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Number of Edges in Hypergraphs Cr
On the Number of Edges in Hypergraphs Critical with Respect to Strong Colourings
✍ Alexandr V. Kostochka; Douglas R. Woodall πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 94 KB

A colouring of the vertices of a hypergraph G is called strong if, for every edge A, the colours of all vertices in A are distinct. It corresponds to a colouring of the generated graph (G) obtained from G by replacing every edge by a clique. We estimate the minimum number of edges possible in a k-cr

The chromaticity of complete bipartite g
The chromaticity of complete bipartite graphs with at most one edge deleted
✍ C. P. Teo; K. M. Koh πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 364 KB πŸ‘ 1 views

## Abstract Let __K(p, q), p ≀ q__, denote the complete bipartite graph in which the two partite sets consist of __p__ and __q__ vertices, respectively. In this paper, we prove that (1) the graph __K(p, q)__ is chromatically unique if __p__ β‰₯ 2; and (2) the graph __K(p, q)__ ‐ __e__ obtained by del

On the simplicial 3-polytopes with only
On the simplicial 3-polytopes with only two types of edges
✍ Stanislav JendroΔΎ; Michal TkÑč πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 492 KB

For some families of graphs of simplicial 3-polytopes with two types of edges structural properties are described, for other ones their cardinality is determined. ## 1. ln~oduction Griinbaum and Motzkin [3], Griinbaum and Zaks [4], and Malkevitch [6] investigated the structural properties of triva