Even cycles in hypergraphs
type: Item
instance of: scholarly article
title: Even cycles in hypergraphs
zbMATH Open document ID: 1062.05105
published in: Journal of Combinatorial Theory. Series B
publication date: 2005-05-04T00:00:00Z
review text: This paper determines the possible maximum number of (not necessarily distinct) edges in an \(n\)-vertices hypergraph without even cycles.
reviewed by: Péter L. Erdős
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 2165074
zbMATH Keywords: hypertree
author: Alexandr Kostochka
author: J. Verstraëte
MaRDI profile type: Publication
full work available at URL: j.jctb.2004.12.004
OpenAlex ID: W2040526841
cites work: Q5668821
cites work: Q3433939
cites work: Q4276003
cites work: Q4869540
DOI: 10.1016/J.JCTB.2004.12.004
description: scientific article; zbMATH DE number 2165074