Mixed matchings in graphs

DOI10.1016/J.DISC.2019.111660MaRDI QIDQ2279983zbMATH OpenOpenAlexFDO

Authors Peter Frankl

Publication date 17 December 2019

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2019.111660

zbMATH Keywords

extremal problemsmatchings

Mathematics Subject Classification ID

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

Recommendations

• On matchings in graphs
• On edge-disjoint pairs of matchings
• On matchings in hypergraphs
• On non-trivial families without a perfect matching
• On the size of the product of overlapping families

Cites work

• scientific article; zbMATH DE number 3166040 (Why is no real title available?)
• scientific article; zbMATH DE number 487720 (Why is no real title available?)
• scientific article; zbMATH DE number 3221072 (Why is no real title available?)
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On the maximum number of edges in a hypergraph with given matching number
• On the size of graphs with complete-factors

Cited in

(5)

• On non-trivial families without a perfect matching
• scientific article; zbMATH DE number 3957168 (Why is no real title available?)
• On matchings in graphs
• Matchings in Graphs Variations of the Problem
• A note on the minimum size of matching-saturated graphs

This page was built for publication: Mixed matchings in graphs

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