ON HYPERGRAPH COLOURINGS

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 1986 English Publisher:Oxford University Press (OUP)Journal:The Quarterly Journal of Mathematics, volume 37, pages 239-243 (issn: 0033-5606, eissn: 1464-3847,

Copyright policy )

Authors: Tomescu, Ioan;

doi: 10.1093/qmath/37.2.239

ON HYPERGRAPH COLOURINGS

- Summary
- Subjects
- Metrics

Abstract

There is proved that every \((h+1)\)-uniform hypergraph H with \(\chi (H)=k\geq 3\) contains a cycle of length at least k and deduced the asymptotic behaviour of the maximum number of k-colourings in the class of all \((h+1)\)-hypergraphs of order n with \(\chi (H)=k\).

Related Organizations

University of Bucharest
Romania

Keywords

Coloring of graphs and hypergraphs, cycle, uniform hypergraph, colourings, Hypergraphs, Paths and cycles

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

0

Average

Fields of Science

Fields of Science

Upload OA version

Are you the author of this publication? Upload your Open Access version to Zenodo!

It’s fast and easy, just two clicks!

uploadUpload now