Mixed matchings in graphs

DOI10.1016/J.DISC.2019.111660zbMATH Open1429.05161OpenAlexW2980064435MaRDI QIDQ2279983FDOQ2279983

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

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

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)

Cites Work

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On the size of graphs with complete-factors
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the maximum number of edges in a hypergraph with given matching number

Cited In (5)

• On non-trivial families without a perfect matching
• Title not available (Why is that?)
• 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)