The Size of a Hypergraph and its Matching Number (Q2888870): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On a conjecture of milner on k-graphs with non-disjoint edges / 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: SETS OF INDEPENDENT EDGES OF A HYPERGRAPH / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a Chebyshev-Type Inequality for Sums of Independent Random Variables / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new generalization of the Erdős-Ko-Rado theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On maximal paths and circuits of graphs / rank | |||
Normal rank |
Revision as of 07:57, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Size of a Hypergraph and its Matching Number |
scientific article |
Statements
The Size of a Hypergraph and its Matching Number (English)
0 references
4 June 2012
0 references