The size of k-pseudotrees

DOI10.1016/0012-365X(93)E0197-CMaRDI QIDQ1894770zbMATH OpenOpenAlexFDO

Authors Emanuel Knill, Andrzej Ehrenfeucht, David Haussler

Publication date 24 July 1995

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(93)e0197-c

zbMATH Keywords

treestrees of sets

Mathematics Subject Classification ID

Trees (05C05)

Review text

The authors study a generalized set theoretic version of trees and give an upper estimate for its maximum cardinality.

Cites work

• Chromatic polynomials of generalized trees
• Higher-dimensional tree structures. I
• scientific article; zbMATH DE number 42741 (Why is no real title available?)
• Intersection Theorems on Structures
• The NP-completeness column: an ongoing guide

Cited in

(1)

• scientific article; zbMATH DE number 5551578 (Why is no real title available?)

This page was built for publication: The size of \(k\)-pseudotrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894770)