Matchings and covers in hypergraphs
From MaRDI portal
Cites work
- 2-Matchings and 2-covers of hypergraphs
- A bound for blocking sets of Rédei type in finite projective planes
- A Conjecture Concerning Neighboring Tetrahedra
- A finite set covering theorem
- A generalization of max flow—min cut
- A Helly type theorem for hypersurfaces
- A lower bound for 0,1,* tournament codes
- A Problem in Graph Theory
- A simple proof of the upper bound theorem
- A Sperner theorem on unrelated chains of subsets
- A Theorem on k-Saturated Graphs
- An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
- An extension of a theorem of the Bruijn and Erdős on combinatorial designs
- An extremal problem for sets with applications to graph theory
- An extremal problem for two families of sets
- AN EXTREMAL PROBLEM IN GRAPH THEORY
- An intersection problem with 6 extremes
- An upper-bound theorem for families of convex sets
- Arrangements of Lines with a Large Number of Triangles
- Asymptotically good coverings
- Baer subplanes and blocking sets
- Blocking and anti-blocking pairs of polyhedra
- Blocking Sets in Affine Planes
- Blocking sets in block designs
- Blocking Sets in Finite Projective Planes
- Blocking sets, k-arcs and nets of order ten
- Bounds of neighborly families of convex polytopes
- Coloring n-sets red and blue
- Covering finite fields with cosets of subspaces
- Covering pairs by q^ 2+q+1 sets
- Covering the complete graph by partitions
- Covering triples by quadruples: an asymptotic solution
- Coverings of pairs by quintuples
- Coverings pairs by quintuples: The case v congruent to 3 (mod 4)
- Critical hypergraphs and interesting set-pair systems
- Decomposition of the complete hypergraph into delta-systems. I
- Decomposition of the complete hypergraph into delta-systems. II
- Degrees and matchings
- DISJOINT r-TUPLES IN AN r-GRAPH WITH GIVEN MAXIMUM DEGREE
- DISJOINT TRIPLES IN A 3-GRAPH WITH GIVEN MAXIMAL DEGREE
- Edmonds polytopes and a hierarchy of combinatorial problems
- Embedding maximal cliques of sets in maximal cliques of bigger sets
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Establishing the matching polytope
- Extremal problems among subsets of a set
- Extremal problems in graph theory
- Families of finite sets in which no set is covered by the union of \(r\) others
- Families of finite sets in which no set is covered by the union of two others
- Finite projective spaces and intersecting hypergraphs
- Fractional matchings and covers in infinite hypergraphs
- Geometrical solution of an intersection problem for two hypergraphs
- Golden ratios in a pairs covering problem
- Graph Theory and Integer Programming
- Helly families of maximal size
- Helly-type hypergraphs and Sperner families
- Hide and Seek, Data Storage, and Entropy
- scientific article; zbMATH DE number 3831957 (Why is no real title available?)
- scientific article; zbMATH DE number 3882446 (Why is no real title available?)
- scientific article; zbMATH DE number 3884213 (Why is no real title available?)
- scientific article; zbMATH DE number 3884215 (Why is no real title available?)
- scientific article; zbMATH DE number 3166040 (Why is no real title available?)
- scientific article; zbMATH DE number 3891413 (Why is no real title available?)
- scientific article; zbMATH DE number 3823793 (Why is no real title available?)
- scientific article; zbMATH DE number 3922663 (Why is no real title available?)
- scientific article; zbMATH DE number 3930895 (Why is no real title available?)
- scientific article; zbMATH DE number 3935081 (Why is no real title available?)
- scientific article; zbMATH DE number 3959292 (Why is no real title available?)
- scientific article; zbMATH DE number 3961629 (Why is no real title available?)
- scientific article; zbMATH DE number 3981954 (Why is no real title available?)
- scientific article; zbMATH DE number 3983170 (Why is no real title available?)
- scientific article; zbMATH DE number 4008289 (Why is no real title available?)
- scientific article; zbMATH DE number 4008407 (Why is no real title available?)
- scientific article; zbMATH DE number 4008431 (Why is no real title available?)
- scientific article; zbMATH DE number 4029608 (Why is no real title available?)
- scientific article; zbMATH DE number 4031696 (Why is no real title available?)
- scientific article; zbMATH DE number 4036592 (Why is no real title available?)
- scientific article; zbMATH DE number 4043770 (Why is no real title available?)
- scientific article; zbMATH DE number 4057513 (Why is no real title available?)
- scientific article; zbMATH DE number 4065037 (Why is no real title available?)
- scientific article; zbMATH DE number 4070935 (Why is no real title available?)
- scientific article; zbMATH DE number 4077533 (Why is no real title available?)
- scientific article; zbMATH DE number 4104975 (Why is no real title available?)
- scientific article; zbMATH DE number 3651315 (Why is no real title available?)
- scientific article; zbMATH DE number 3683619 (Why is no real title available?)
- scientific article; zbMATH DE number 3691382 (Why is no real title available?)
- scientific article; zbMATH DE number 3695222 (Why is no real title available?)
- scientific article; zbMATH DE number 3708458 (Why is no real title available?)
- scientific article; zbMATH DE number 3733982 (Why is no real title available?)
- scientific article; zbMATH DE number 3751011 (Why is no real title available?)
- scientific article; zbMATH DE number 3788645 (Why is no real title available?)
- scientific article; zbMATH DE number 13857 (Why is no real title available?)
- scientific article; zbMATH DE number 3472051 (Why is no real title available?)
- scientific article; zbMATH DE number 3477226 (Why is no real title available?)
- scientific article; zbMATH DE number 3496213 (Why is no real title available?)
- scientific article; zbMATH DE number 3501547 (Why is no real title available?)
- scientific article; zbMATH DE number 3530031 (Why is no real title available?)
- scientific article; zbMATH DE number 3549009 (Why is no real title available?)
- scientific article; zbMATH DE number 3556114 (Why is no real title available?)
- scientific article; zbMATH DE number 3559289 (Why is no real title available?)
- scientific article; zbMATH DE number 3561367 (Why is no real title available?)
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- scientific article; zbMATH DE number 3616474 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 568784 (Why is no real title available?)
- scientific article; zbMATH DE number 3435527 (Why is no real title available?)
- scientific article; zbMATH DE number 2123255 (Why is no real title available?)
- scientific article; zbMATH DE number 3204639 (Why is no real title available?)
- scientific article; zbMATH DE number 3205160 (Why is no real title available?)
- scientific article; zbMATH DE number 3211575 (Why is no real title available?)
- scientific article; zbMATH DE number 3214278 (Why is no real title available?)
- scientific article; zbMATH DE number 3227181 (Why is no real title available?)
- scientific article; zbMATH DE number 3232670 (Why is no real title available?)
- scientific article; zbMATH DE number 3238444 (Why is no real title available?)
- scientific article; zbMATH DE number 3239217 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- scientific article; zbMATH DE number 3353329 (Why is no real title available?)
- scientific article; zbMATH DE number 3363617 (Why is no real title available?)
- scientific article; zbMATH DE number 3370377 (Why is no real title available?)
- scientific article; zbMATH DE number 3373541 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- scientific article; zbMATH DE number 3415888 (Why is no real title available?)
- scientific article; zbMATH DE number 3198027 (Why is no real title available?)
- Hyperclaw Decomposition of Complete Hypergraphs
- Hypergraphs without a large star
- Inequalities for two set systems with prescribed intersections
- Interpolation of functions over a measure space and conjectures about memory
- Intersection patterns of convex sets
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection theorems for systems of sets
- Intersection Theorems for Systems of Sets
- Large Graphs with Given Degree and Diameter III
- Large graphs with given degree and diameter. II
- Large Graphs with Given Degree and Diameter—Part I
- Long induced paths and cycles in Kneser graphs
- Lower bounds on blocking sets
- Matching theory
- Matchings in n-partite n-graphs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Maximal intersecting families and affine regular polygons in PG(2,q)
- Maximal Intersecting Families of Finite Sets and n-Uniform Hjelmslev Planes
- Maximal matchings in graphs with given minimal and maximal degrees
- Maximum degree and fractional matchings in uniform hypergraphs
- Maximum matching and a polyhedron with 0,1-vertices
- Minimal coverings of pairs by triples
- More on maximal intersecting families of finite sets
- Mutually disjoint families of 0-1 sequences
- Near perfect coverings in graphs and hypergraphs
- Neighborly families of \(2^ k\) k-simplices in \(E^ k\).
- Neighborly Families of Congruent Convex Polytopes
- No nine neighborly tetrahedra exist
- Non-trivial intersecting families
- Normal hypergraphs and the perfect graph conjecture
- On 3-chromatic hypergraphs
- On a combinatorial problem. II
- On a Conjecture of Erdos, Hajnal and Moon
- On a family of line-critical graphs
- On a packing and covering problem
- On a Problem of Additive Number Theory
- On a Problem of C. E. Shannon in Graph Theory
- On a property of families of sets
- On blocking sets in symmetric BIBD's with 2
- On coverings
- On coverings of a finite set: Depth and subcovers
- On disjointly representable sets
- On generalized graphs
- On generalized Ramsey numbers for trees
- On Helly families of maximal size
- On intersecting families of finite sets
- On intersecting families of finite sets
- On large sets of disjoint Steiner triple systems. I
- On maximal intersecting families of finite sets
- On the combinatorial problems which I would most like to see solved
- On the covering of pairs by quadruples. I
- On the covering of pairs by quadruples. II
- On the Fractional Covering Number of Hypergraphs
- On the fractional matching polytope of a hypergraph
- On the Fractional Solution to the Set Covering Problem
- On the kernel of intersecting families
- On the nuclei of a pointset of a finite projective plane
- On the ratio of optimal integral and fractional covers
- On the representing number of intersecting families
- On the Shannon capacity of a graph
- On the Size of a Maximum Transversal in a Steiner Triple System
- ON THE WEIGHT DISTRIBUTION IN BINARY CODES GENERATED BY PROJECTIVE PLANES
- On two Combinatorial Problems Arising from Automata Theory
- On two minimax theorems in graph
- Packing Problems and Hypergraph Theory: A Survey
- Partial Parallel Classes in Steiner System S(2, 3, 19)
- Paths, Trees, and Flowers
- Primes in short intervals
- Properties of vertex packing and independence system polyhedra
- Ramsey numbers for the path with three edges
- Regularisable graphs I
- Sets of finite sets satisfying union conditions
- Shellable Decompositions of Cells and Spheres.
- Solution of a problem of A. Ehrenfeucht and J. Mycielski
- Solution of two fractional packing problems of Lovász
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Sur la cardinalite maximum des couplages d'hypergraphes aléatoires uniformes
- Symmetric designs as the solution of an extremal problem in combinatorial set theory
- t-expansive and t-wise intersecting hypergraphs
- The 1-Factors of Oriented Graphs
- The blocking number of an affine space
- The chromatic index of cyclic Steiner 2-designs
- The maximum numbers of faces of a convex polytope
- The Number of Edges in a k–Helly Hypergraph
- The orchard problem
- Two combinatorial covering theorems
- Upper bound for transversals of tripartite hypergraphs
- Upper bound on the order of tau-critical hypergraphs
- τ–Critical Hypergraphs and the Helly Property
Cited in
(only showing first 100 items - show all)- Random constructions and density results
- On the number of pairwise non-isomorphic minimal blocking sets in \(\mathrm{PG}(2,q)\)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Triangle packings and 1-factors in oriented graphs
- A spectrum result on maximal partial ovoids of the generalized quadrangle \(Q(4,q)\), \(q\) even
- Fractional matchings and covers in infinite hypergraphs
- Weighted arcs, the finite Radon transform and a Ramsey problem
- A note on induced cycles in Kneser graphs
- Covering \(t\)-element sets by partitions
- Matchings and cycle covers in random digraphs
- Multiply-intersecting families
- A fractional version of the Erdős-Faber-Lovász conjecture
- On a problem of Erdős and Lovász: Random lines in a projective plane
- Blocking sets in Desarguesian affine and projective planes
- Covering graphs: The covering problem solved
- On the stochastic independence properties of hard-core distributions
- Packing and covering triangles in graphs
- The fractional dimension of subsets of Boolean lattices and cartesian products
- Small blocking sets of Hermitian designs
- Intersecting designs from linear programming and graphs of diameter two
- Fractional isomorphism of graphs
- The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique
- A note on a conjecture of Ryser
- Fractional v. integral covers in hypergraphs of bounded edge size
- A note on \(\tau\)-critical linear hypergraphs
- On fractional Ramsey numbers
- On homomorphisms from the Hamming cube to \(\mathbb{Z}\)
- Domination in intersecting hypergraphs
- The skiving stock problem and its relation to hypergraph matchings
- Coverings: variations on a result of Rogers and on the epsilon-net theorem of Haussler and Welzl
- Extremal hypergraphs for matching number and domination number
- Saturating sets in projective planes and hypergraph covers
- The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four
- On approximation of the vertex cover problem in hypergraphs
- Near-perfect clique-factors in sparse pseudorandom graphs
- Bounds for optimal coverings
- Uniform intersecting families with covering number four
- On a conjecture of Tuza about packing and covering of triangles
- On two set-systems with restricted cross-intersections
- Maximal intersection critical families of finite sets
- On a theorem of Lovász on covers in \(r\)-partite hypergraphs
- A survey on hypergraph products
- A bound for 1-cross intersecting set pair systems
- Covering graphs by monochromatic trees and Helly-type results for hypergraphs
- The structure of large non-trivial \(t\)-intersecting families of finite sets
- Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
- Ramsey numbers of path-matchings, covering designs, and 1-cores
- Nearly neighbourly families of standard boxes
- Domination and matching in power and generalized power hypergraphs
- Approximating set multi-covers
- Matching and domination numbers in \(r\)-uniform hypergraphs
- Sequential legislative lobbying
- Relative blocking in posets
- On a hypergraph matching problem
- A note on a conjecture by Füredi
- Discrepancies of spanning trees and Hamilton cycles
- On some covering problems in geometry
- Nearly-perfect hypergraph packing is in NC
- Santa claus meets hypergraph matchings
- scientific article; zbMATH DE number 3887743 (Why is no real title available?)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- scientific article; zbMATH DE number 5308553 (Why is no real title available?)
- Santa Claus Meets Hypergraph Matchings
- On the size of 3-uniform linear hypergraphs
- On vertex independence number of uniform hypergraphs
- Disjoint systems
- Covers in 4-uniform intersecting families with covering number three
- A broadcast key distribution scheme based on block designs
- On large minimal blocking sets in PG(2,q)
- Covers in Block Designs
- On Brooks' Theorem for Sparse Graphs
- Blocking sets of the classical unital
- Pseudorandom hypergraph matchings
- Combinatorics in the exterior algebra and the Bollobás two families theorem
- Efficient constructions of hitting sets for systems of linear functions
- scientific article; zbMATH DE number 7626788 (Why is no real title available?)
- scientific article; zbMATH DE number 7559412 (Why is no real title available?)
- A generalization of Hall's theorem for \(k\)-uniform \(k\)-partite hypergraphs
- Matching criticality in intersecting hypergraphs
- A rainbow \(r\)-partite version of the Erdős-Ko-Rado theorem
- On covering expander graphs by Hamilton cycles
- Matchings in hypergraphs of large minimum degree
- Near-perfect clique-factors in sparse pseudorandom graphs
- Small complete arcs in André planes of square order
- On the Weisfeiler-Leman dimension of fractional packing
- Small complete arcs in André planes of square order
- Fractional covers of hypergraphs with bounded multi-intersection
- Tuza's conjecture for random graphs
- Problems and results on 1-cross-intersecting set pair systems
- Graph and hypergraph colouring via nibble methods: a survey
- Paradigms for Unconditional Pseudorandom Generators
- The existence of \(k\)-radius sequences
- Generalized Tuza's conjecture for random hypergraphs
- The power of many colours
- Non-trivial t-intersecting families for the distance-regular graphs of bilinear forms
- On the fractional matching polytope of a hypergraph
- Covering-based numbers related to the LS-category of finite spaces
- Fairness in graph-theoretical optimization problems
- On Ryser's conjecture for linear intersecting multipartite hypergraphs
- Invitation to intersection problems for finite sets
This page was built for publication: Matchings and covers in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1813100)
