Smallest set-transversals of k-partitions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 786134 (Why is no real title available?)
- A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
- About the upper chromatic number of a co-hypergraph
- Coloring mixed hypergraphs: theory, algorithms and applications
- Forestation in hypergraphs: Linear \(k\)-trees
- On the minimum size of tight hypergraphs
- The size of minimum 3-trees
- Un Probleme De Coloration Aux Aspects Varies
- Un problème extremal pour les graphes et les hypergraphes
Cited in
(10)- Chains of subsemigroups
- scientific article; zbMATH DE number 4057515 (Why is no real title available?)
- Partitioning the power set of \([n]\) into \(C_k\)-free parts
- Common transversals for partitions of a finite set
- Partition-crossing hypergraphs
- Maximum number of colors: C-coloring and related problems
- Equations for point configurations to Lie on a rational normal curve
- scientific article; zbMATH DE number 3868663 (Why is no real title available?)
- The existential transversal property: a generalization of homogeneity and its impact on semigroups
- On the shortest sequences of elementary transformations in the partition lattice
This page was built for publication: Smallest set-transversals of \(k\)-partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968226)