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