Smallest set-transversals of k-partitions

DOI10.1007/S00373-010-0890-4zbMATH Open1205.05114OpenAlexW2080264125WikidataQ59072690 ScholiaQ59072690MaRDI QIDQ968226FDOQ968226

Authors: Csilla Bujtás, Zsolt Tuza 

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

Recommendations

• Partition-crossing hypergraphs
• Common transversals for partitions of a finite set
• scientific article; zbMATH DE number 4057515
• Independent Transversals in Sparse Partite Hypergraphs
• The Chromatic Number of Kneser Hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Cites Work

• Title not available (Why is that?)
• Coloring mixed hypergraphs: theory, algorithms and applications
• A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
• On the minimum size of tight hypergraphs
• Forestation in hypergraphs: Linear \(k\)-trees
• About the upper chromatic number of a co-hypergraph
• 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)

• The existential transversal property: a generalization of homogeneity and its impact on semigroups
• Partition-crossing hypergraphs
• Equations for point configurations to Lie on a rational normal curve
• Maximum number of colors: C-coloring and related problems
• Title not available (Why is that?)
• Partitioning the power set of \([n]\) into \(C_k\)-free parts
• On the shortest sequences of elementary transformations in the partition lattice
• Common transversals for partitions of a finite set
• Chains of subsemigroups
• Title not available (Why is that?)

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)