Maximum degree and fractional matchings in uniform hypergraphs
From MaRDI portal
Publication:1168988
DOI10.1007/BF02579271zbMath0494.05045OpenAlexW1984103551MaRDI QIDQ1168988
Publication date: 1981
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579271
projective planesuniform hypergraphsintersecting hypergraphsfractional transversalr-partite hypergraphs
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Combinatorial aspects of finite geometries (05B25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Projective planes and congestion-free networks ⋮ t-expansive and t-wise intersecting hypergraphs ⋮ Improved monochromatic double stars in edge colorings ⋮ Generalizations and strengthenings of Ryser's conjecture ⋮ Vector representation of graph domination ⋮ Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance ⋮ Large monochromatic components and long monochromatic cycles in random hypergraphs ⋮ The feasible matching problem ⋮ A note on a conjecture of Ryser ⋮ Generalized Hypergraph Matching via Iterated Packing and Local Ratio ⋮ Weighted fractional and integral \(k\)-matching in hypergraphs ⋮ Load balancing in quorum systems ⋮ On a conjecture of Tuza about packing and covering of triangles ⋮ Finite projective spaces and intersecting hypergraphs ⋮ Coverings and matchings in r-partite hypergraphs ⋮ Optima of dual integer linear programs ⋮ Randomized rounding: A technique for provably good algorithms and algorithmic proofs ⋮ Symmetric designs as the solution of an extremal problem in combinatorial set theory ⋮ The skiving stock problem and its relation to hypergraph matchings ⋮ Bus interconnection networks ⋮ The geometry and combinatorics of discrete line segment hypergraphs ⋮ Packing and covering tetrahedra ⋮ Edge-covers in \(d\)-interval hypergraphs ⋮ Integrality gaps for colorful matchings ⋮ On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs ⋮ Fair division with multiple pieces ⋮ A stability theorem on fractional covering of triangles by edges ⋮ On some Multicolor Ramsey Properties of Random Graphs ⋮ Size of monochromatic components in local edge colorings ⋮ A sparse colorful polytopal KKM theorem ⋮ Using Brouwer’s Fixed Point Theorem ⋮ Covering the complete graph by partitions ⋮ On the number of distinct differences in an intersecting family ⋮ Forcing large tight components in 3-graphs ⋮ Monochromatic partitions in local edge colorings ⋮ Envy-free two-player \(m\)-cake and three-player two-cake divisions ⋮ Vertex coverings by monochromatic cycles and trees ⋮ Covering \(t\)-element sets by partitions ⋮ An isoperimetric lemma ⋮ Covers in partitioned intersecting hypergraphs ⋮ On symmetric intersecting families ⋮ Colourings without monochromatic disjoint pairs ⋮ Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem ⋮ Partitioning random graphs into monochromatic components ⋮ On the fractional matching polytope of a hypergraph ⋮ Highly connected monochromatic subgraphs ⋮ Membership criteria and containments of powers of monomial ideals ⋮ On the Weisfeiler-Leman dimension of fractional packing ⋮ Gallai colorings of non-complete graphs ⋮ Unnamed Item ⋮ Combinatorics of unavoidable complexes ⋮ On linear and semidefinite programming relaxations for hypergraph matching ⋮ Extremal hypergraphs for Ryser's conjecture ⋮ Monochromatic components in edge-colored complete uniform hypergraphs ⋮ Multipartite hypergraphs achieving equality in Ryser's conjecture ⋮ A note on 2-edge-colorings of complete graphs with small monochromatic \(k\)-connected subgraphs ⋮ Highly connected multicoloured subgraphs of multicoloured graphs ⋮ Approximate multi-matroid intersection via iterative refinement ⋮ Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey ⋮ Size of monochromatic double stars in edge colorings ⋮ Highly connected monochromatic subgraphs of multicolored graphs ⋮ On a possible extension of Hall's theorem to bipartite hypergraphs ⋮ Matchings and covers in hypergraphs ⋮ Large monochromatic components in colorings of complete 3-uniform hypergraphs ⋮ Clique covers and coloring problems of graphs ⋮ Maximum degree and diversity in intersecting hypergraphs ⋮ Coloring by two-way independent sets ⋮ Regular intersecting families ⋮ Improved bounds on a generalization of Tuza's conjecture ⋮ Covering pairs by \(q^ 2+q+1\) sets ⋮ Intersecting designs from linear programming and graphs of diameter two ⋮ Monochromatic coverings and tree Ramsey numbers ⋮ Mono-multi bipartite Ramsey numbers, designs, and matrices
Cites Work
