Ryser's conjecture for tripartite 3-graphs
From MaRDI portal
Publication:873644
DOI10.1007/s004930170001zbMath1107.05307OpenAlexW2043399762WikidataQ123253648 ScholiaQ123253648MaRDI QIDQ873644
Publication date: 29 March 2007
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930170001
Related Items
Generalizations and strengthenings of Ryser's conjecture, Vertex covers by monochromatic pieces -- a survey of results and problems, Vector representation of graph domination, A family of extremal hypergraphs for Ryser's conjecture, The feasible matching problem, Graph theory -- a survey on the occasion of the Abel Prize for László Lovász, Coverings and matchings in r-partite hypergraphs, A note on intersecting hypergraphs with large cover number, Vertex covering with monochromatic pieces of few colours, The geometry and combinatorics of discrete line segment hypergraphs, On a Generalization of the Ryser-Brualdi-Stein Conjecture, Matching and domination numbers in \(r\)-uniform hypergraphs, Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs, Small edge sets meeting all triangles of a graph, Triangle packings and transversals of some \(K_{4}\)-free graphs, Longest partial transversals in plexes, How many colors guarantee a rainbow matching?, A note on covering edge colored hypergraphs by monochromatic components, On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs, Extremal hypergraphs for matching number and domination number, A note on the edge cover number and independence number in hypergraphs, Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees, Ryser's conjecture for \(t\)-intersecting hypergraphs, Independent systems of representatives in weighted graphs, Covers in partitioned intersecting hypergraphs, Partitioning random graphs into monochromatic components, Rainbow perfect matchings in \(r\)-partite graph structures, The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four, Unnamed Item, On linear and semidefinite programming relaxations for hypergraph matching, A geometric Hall-type theorem, Extremal hypergraphs for Ryser's conjecture, On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs, Monochromatic components in edge-colored complete uniform hypergraphs, On Ryser's conjecture for linear intersecting multipartite hypergraphs, Multipartite hypergraphs achieving equality in Ryser's conjecture, A generalization of Hall's theorem for $k$-uniform $k$-partite hypergraphs, Domination and matching in power and generalized power hypergraphs, Nonintersecting Ryser Hypergraphs, Covering graphs by monochromatic trees and Helly-type results for hypergraphs, A Stability Theorem for Matchings in Tripartite 3-Graphs, Domination and Total Domination in Hypergraphs, Finding independent transversals efficiently, Covering 3-Edge-Colored Random Graphs with Monochromatic Trees, A comment on Ryser's conjecture for intersecting hypergraphs, Hypergraph cuts above the average, The intersection of a matroid and a simplicial complex, Piercing numbers in approval voting, Covering complete graphs by monochromatically bounded sets
