Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

On \(3\)-Uniform Hypergraphic Sequences

Nirmala Achuthan1, N. R. Achuthan1, M. Simanihuruk1
1School of Mathematics and Statistics Curtin University of Technology G.P.0. Box U1987 PERTH W.A. 6001
  • Published: 31/10/1993

Abstract

This paper discusses new Erdös-Gallai type necessary conditions for a sequence \(\prod\) of integers to be \(3\)-hypergraphic. Further, we show that some of the known necessary conditions for \(3\)-hypergraphic sequences are not sufficient.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Nirmala Achuthan, N. R. Achuthan, M. Simanihuruk. On \(3\)-Uniform Hypergraphic Sequences[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 014. 3-13. DOI: .