Matching stability for 3-partite 3-uniform hypergraphs

Cites work

A rainbow \(r\)-partite version of the Erdős-Ko-Rado theorem
A stability result on matchings in 3-uniform hypergraphs
Degrees giving independent edges in a hypergraph
Dirac-type questions for hypergraphs -- a survey (or more problems for Endre to solve)
Embedding large subgraphs into dense graphs
Fractional and integer matchings in uniform hypergraphs
scientific article; zbMATH DE number 3166040 (Why is no real title available?)
scientific article; zbMATH DE number 3461973 (Why is no real title available?)
scientific article; zbMATH DE number 3221072 (Why is no real title available?)
Improved bounds for Erdős' matching conjecture
INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
Matchings in hypergraphs of large minimum degree
On Erdős' extremal problem on matchings in hypergraphs
On maximal paths and circuits of graphs
On the maximum number of edges in a hypergraph with given matching number
On the maximum number of edges in a triple system not containing a disjoint family of a given size
On the size of graphs with complete-factors
Perfect matchings in 3-partite 3-uniform hypergraphs
Perfect matchings in \(r\)-partite \(r\)-graphs
Perfect matchings in hypergraphs and the Erdős matching conjecture
Proof of the Erdős matching conjecture in a new range
SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
The Erdős matching conjecture and concentration inequalities
The size of a hypergraph and its matching number
Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman

This page was built for publication: Matching stability for 3-partite 3-uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7397571)