ScholarLens Back to search
1999•Results in MathematicsRequires access

An Upper Bound to the Chromatic Number of a Uniform Hypergraph without Cycles of Length Two or Three

Klaus Dohmen

Open publisher page 0 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Hypergraph, Chromatic scale, Upper and lower bounds, Mathematics, Combinatorics, Discrete mathematics, Mathematical analysis

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
An Upper Bound to the Chromatic Number of a Uniform Hypergraph without Cycles of Length Two or Three — Research Paper | ScholarLens