Matchings and covers in hypergraphs (Q1813100): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: AN EXTREMAL PROBLEM IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3934438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems for systems of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3885788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3728916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the representing number of intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional matchings and covers in infinite hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long induced paths and cycles in Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal problem for sets with applications to graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the kernel of intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of the upper bound theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutually disjoint families of 0-1 sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Conjecture Concerning Neighboring Tetrahedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Establishing the matching polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On coverings of a finite set: Depth and subcovers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5333059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-chromatic hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5680153 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularisable graphs I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Problems and Hypergraph Theory: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4294575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3780901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3039368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large graphs with given degree and diameter. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Graphs with Given Degree and Diameter III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey numbers for the path with three edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized Ramsey numbers for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on maximal intersecting families of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Conjecture of Erdos, Hajnal and Moon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: DISJOINT TRIPLES IN A 3-GRAPH WITH GIVEN MAXIMAL DEGREE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Helly families of maximal size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Helly families of maximal size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal matchings in graphs with given minimal and maximal degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal intersecting families and affine regular polygons in \(PG(2,q)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite set covering theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of a Maximum Transversal in a Steiner Triple System / rank
 
Normal rank
Property / cites work
 
Property / cites work: The blocking number of an affine space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Baer subplanes and blocking sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking Sets in Finite Projective Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking sets, k-arcs and nets of order ten / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking Sets in Affine Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on blocking sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shellable Decompositions of Cells and Spheres. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orchard problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5331500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric designs as the solution of an extremal problem in combinatorial set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3727877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Fractional Covering Number of Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edmonds polytopes and a hierarchy of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees and matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic index of cyclic Steiner 2-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for 0,1,* tournament codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5341481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets of finite sets satisfying union conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Graphs with Given Degree and Diameter—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Helly type theorem for hypersurfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3792687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking sets in block designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding maximal cliques of sets in maximal cliques of bigger sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Intersecting Families of Finite Sets and n-Uniform Hjelmslev Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3900108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper-bound theorem for families of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4078069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation of functions over a measure space and conjectures about memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a combinatorial problem. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the combinatorial problems which I would most like to see solved / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of finite sets in which no set is covered by the union of two others / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of finite sets in which no set is covered by the union of \(r\) others / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3284375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Problem in Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5734432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems among subsets of a set / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Theorems for Systems of Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5520566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Parallel Classes in Steiner System S(2, 3, 19) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal coverings of pairs by triples / rank
 
Normal rank
Property / cites work
 
Property / cites work: On intersecting families of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On intersecting families of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal problem for two families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3770569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős-Ko-Rado theorem with conditions on the maximal degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: DISJOINT <i>r</i>-TUPLES IN AN <i>r</i>-GRAPH WITH GIVEN MAXIMUM DEGREE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite projective spaces and intersecting hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-trivial intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3829565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On disjointly representable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near perfect coverings in graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal intersecting families of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum degree and fractional matchings in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An intersection problem with 6 extremes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometrical solution of an intersection problem for two hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: t-expansive and t-wise intersecting hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3978109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering pairs by \(q^ 2+q+1\) sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering the complete graph by partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fractional matching polytope of a hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arrangements of Lines with a Large Number of Triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs without a large star / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5338785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5645210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5547252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sperner theorem on unrelated chains of subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bound on the order of tau-critical hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3879261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on <i>k</i>-Saturated Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5515488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering triples by quadruples: an asymptotic solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of max flow—min cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5642587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering finite fields with cosets of subspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3748286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection patterns of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a problem of A. Ehrenfeucht and J. Mycielski / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5525916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound for blocking sets of Rédei type in finite projective planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: τ–Critical Hypergraphs and the Helly Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3705356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Problem of Additive Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4060999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4180391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Matchings and 2-covers of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two minimax theorems in graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4123344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On large sets of disjoint Steiner triple systems. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4106341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hide and Seek, Data Storage, and Entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum numbers of faces of a convex polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the covering of pairs by quadruples. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the covering of pairs by quadruples. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3889076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coverings pairs by quintuples: The case v congruent to 3 (mod 4) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of the complete hypergraph into delta-systems. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of the complete hypergraph into delta-systems. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Edges in a k–Helly Hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of vertex packing and independence system polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two Combinatorial Problems Arising from Automata Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a family of line-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On blocking sets in symmetric BIBD's with \(\lambda\geq 2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3746429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3776144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a packing and covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Problem of C. E. Shannon in Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of a theorem of the Bruijn and Erdős on combinatorial designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On coverings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of two fractional packing problems of Lovász / rank
 
Normal rank
Property / cites work
 
Property / cites work: Golden ratios in a pairs covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring n-sets red and blue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically good coverings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two combinatorial covering theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3921273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bound for transversals of tripartite hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3698806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 1-Factors of Oriented Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Helly-type hypergraphs and Sperner families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical hypergraphs and interesting set-pair systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities for two set systems with prescribed intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5526641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nuclei of a pointset of a finite projective plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: An existence theory for pairwise balanced designs. I: Composition theorems and morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds of neighborly families of convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborly families of \(2^ k\) k-simplices in \(E^ k\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: No nine neighborly tetrahedra exist / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborly Families of Congruent Convex Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in n-partite n-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE WEIGHT DISTRIBUTION IN BINARY CODES GENERATED BY PROJECTIVE PLANES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur la cardinalite maximum des couplages d'hypergraphes aléatoires uniformes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3808295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Fractional Solution to the Set Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primes in short intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coverings of pairs by quintuples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3966159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperclaw Decomposition of Complete Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3708835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798697 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01864160 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005616548 / rank
 
Normal rank

Latest revision as of 11:01, 30 July 2024

scientific article
Language Label Description Also known as
English
Matchings and covers in hypergraphs
scientific article

    Statements

    Matchings and covers in hypergraphs (English)
    0 references
    0 references
    25 June 1992
    0 references
    0 references
    0 references
    0 references
    0 references
    covers
    0 references
    matching
    0 references
    covering problem
    0 references
    hypergraph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references