Ryser's conjecture for tripartite 3-graphs
From MaRDI portal
Publication:873644
Cited in
(53)- The geometry and combinatorics of discrete line segment hypergraphs
- Piercing numbers in approval voting
- Generalizations and strengthenings of Ryser's conjecture
- Monochromatic components in edge-colored complete uniform hypergraphs
- Nonintersecting Ryser Hypergraphs
- Monochromatic components in edge-colored complete uniform hypergraphs
- A family of extremal hypergraphs for Ryser's conjecture
- A note on covering edge colored hypergraphs by monochromatic components
- Vertex covers by monochromatic pieces -- a survey of results and problems
- On linear and semidefinite programming relaxations for hypergraph matching
- Triangle packings and transversals of some \(K_{4}\)-free graphs
- A geometric Hall-type theorem
- A generalization of Hall's theorem for \(k\)-uniform \(k\)-partite hypergraphs
- On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs
- Longest partial transversals in plexes
- How many colors guarantee a rainbow matching?
- Covering 3-edge-colored random graphs with monochromatic trees
- Domination and total domination in hypergraphs
- Covering graphs by monochromatic trees and Helly-type results for hypergraphs
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
- A stability theorem for matchings in tripartite 3-graphs
- Coverings and matchings in \(r\)-partite hypergraphs
- A note on intersecting hypergraphs with large cover number
- Matching and domination numbers in \(r\)-uniform hypergraphs
- The intersection of a matroid and a simplicial complex
- On a generalization of the Ryser-Brualdi-Stein conjecture
- A comment on Ryser's conjecture for intersecting hypergraphs
- Vertex covering with monochromatic pieces of few colours
- Vector representation of graph domination
- On Ryser's conjecture for linear intersecting multipartite hypergraphs
- Small edge sets meeting all triangles of a graph
- Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
- Extremal hypergraphs for matching number and domination number
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
- Covers in partitioned intersecting hypergraphs
- Domination and matching in power and generalized power hypergraphs
- A note on the edge cover number and independence number in hypergraphs
- Finding independent transversals efficiently
- Partitioning random graphs into monochromatic components
- Rainbow perfect matchings in \(r\)-partite graph structures
- Almost all triangle-free triple systems are tripartite
- Covering complete graphs by monochromatically bounded sets
- Independent systems of representatives in weighted graphs
- The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four
- Ryser's conjecture for \(t\)-intersecting hypergraphs
- On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs
- Extremal hypergraphs for Ryser's conjecture
- The feasible matching problem
- Multipartite hypergraphs achieving equality in Ryser's conjecture
- Hypergraph cuts above the average
- Covering 3-coloured random graphs with monochromatic trees
- Degree conditions for Ramsey goodness of paths
- Looms
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)
