On non-trivial families without a perfect matching (Q2011158): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q168624
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Peter Frankl / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2019.103044 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2982636504 / 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: Q5510578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3284375 / 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: Q3770569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for Erdős' matching conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of edges in a hypergraph with given matching number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Erdős matching conjecture in a new range / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős matching conjecture and concentration inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman / rank
 
Normal rank
Property / cites work
 
Property / cites work: On matchings in hypergraphs / 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: The Size of a Hypergraph and its Matching Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal number of subsets of a finite set No k of which are pairwise disjoint / rank
 
Normal rank

Latest revision as of 04:09, 21 July 2024

scientific article
Language Label Description Also known as
English
On non-trivial families without a perfect matching
scientific article

    Statements