378 citations
- Technion – Israel Institute of TechnologyIL10 papers
- Boğaziçi UniversityTR5 papers
- Academic College of Tel Aviv-YafoIL3 papers
- Gebze Technical UniversityTR3 papers
- Hebrew University of JerusalemIL3 papers
- Centre National de la Recherche ScientifiqueFR2 papers
- Migal - Galilee Technology CenterIL2 papers
- Tel Aviv UniversityIL2 papers
- Durham UniversityGB1 paper
- Ghent UniversityBE1 paper
- Laboratoire d'Informatique, de Robotique et de Microélectronique de MontpellierFR1 paper
- Leiden UniversityNL1 paper
Showing 2016 · math.COShow all
3 papers · 2 filters
math.CO2016
On two extensions of equimatchable graphs
Zakir Deniz, Tınaz Ekim, Tatiana Romina Hartinger +2
A graph is said to be equimatchable if all its maximal matchings are of the same size. In this work we introduce two extensions of the property of equimatchability by defining two…
math.CO2016★ 3 cited
Degree conditions for matchability in -partite hypergraphs
Ron Aharoni, Eli Berger, Dani Kotlar +1
We study conjectures relating degree conditions in -partite hypergraphs to the matching number of the hypergraph, and use topological methods to prove special cases. In particul…
math.CO2016★ 2 cited
Representation of large matchings in bipartite graphs
Ron Aharoni, Dani Kotlar, Ran Ziv
Let be the smallest number such that every collection of matchings, each of size at least , in a bipartite graph, has a full rainbow matching. Generalizing famous…