Smallest set-transversals of \(k\)-partitions
From MaRDI portal
Publication:968226
DOI10.1007/s00373-010-0890-4zbMath1205.05114OpenAlexW2080264125WikidataQ59072690 ScholiaQ59072690MaRDI QIDQ968226
Publication date: 5 May 2010
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-010-0890-4
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)
Related Items (4)
Equations for point configurations to Lie on a rational normal curve ⋮ Maximum number of colors: C-coloring and related problems ⋮ The existential transversal property: A generalization of homogeneity and its impact on semigroups ⋮ Chains of subsemigroups
Cites Work
- Unnamed Item
- Un problème extremal pour les graphes et les hypergraphes
- Forestation in hypergraphs: Linear \(k\)-trees
- About the upper chromatic number of a co-hypergraph
- Coloring mixed hypergraphs: theory, algorithms and applications
- A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
- The size of minimum 3-trees
- Un Probleme De Coloration Aux Aspects Varies
- On the minimum size of tight hypergraphs
This page was built for publication: Smallest set-transversals of \(k\)-partitions
