On non-trivial families without a perfect matching

DOI10.1016/J.EJC.2019.103044zbMATH Open1428.05244OpenAlexW2982636504MaRDI QIDQ2011158

Could not fetch data.

Publication date: 28 November 2019

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2019.103044

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Improved bounds for Erdős' matching conjecture
• On matchings in hypergraphs
• On the maximum number of edges in a hypergraph with given matching number
• Proof of the Erdős matching conjecture in a new range
• The Erdős matching conjecture and concentration inequalities
• Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
• The Size of a Hypergraph and its Matching Number
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Maximal number of subsets of a finite set No k of which are pairwise disjoint

Related Items (4)

Families with no perfect matchings ⋮ Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs ⋮ On families with bounded matching number ⋮ Almost perfect nonlinear families which are not equivalent to permutations

This page was built for publication: On non-trivial families without a perfect matching

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