Sparse colour-critical hypergraphs
type: Item
instance of: scholarly article
title: Sparse colour-critical hypergraphs
zbMATH Open document ID: 0732.05024
DOI: 10.1007/BF02125892
author: N. E. Zubov
published in: Combinatorica
publication date: 1989-01-01T00:00:00Z
review text: A hypergraph H is called an n-hypergraph if the order of each of its edges equals n. It is called s-critical with respect to colouring if its chromatic number is r and the removal of any edge results in a graph which has chromatic number r-1. A hypergraph is called linear if the intersection of two arbitrary edges is at most 1 vertex. The main question treated in this paper is how few edges on (m,n,r)-graph or linear (m,n,r)-graph may possess. Estimates for the least numbers of that kind are given.
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 4210165
zbMATH Keywords: hypergraph
zbMATH Keywords: chromatic number
zbMATH Keywords: linear
Wikidata QID: Q30039725
MaRDI profile type: Publication
cites work: On a Combinatorial Problem of Erdös and Hajnal
cites work: On A Combinatorial Problem of Erdös
cites work: The existence problem for colour critical linear hypergraphs
cites work: The enumeration problem for color critical linear hypergraphs
cites work: On Property B of Families of Sets
cites work: On 3-chromatic hypergraphs
cites work: On property B and on Steiner systems
cites work: A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
cites work: A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
cites work: Q5724800
cites work: On a combinatorial problem. II
cites work: On A Combinatorial Problem III
cites work: On chromatic number of graphs and set-systems
cites work: Q5732334
cites work: Ein kombinatorisches Problem von P. Erdős und A. Hajnal
cites work: A Note on a Combinatorial Problem of ErdŐS and Hajnal
cites work: ON THE TWO-COLOURING OF HYPERGRAPHS
cites work: Coloring n-sets red and blue
cites work: Colour-critical graphs and hypergraphs
full work available at URL: https://doi.org/10.1007/bf02125892
OpenAlex ID: W2009629999
description: scientific article; zbMATH DE number 4210165