Timeline for Induced matchings in a bipartite graph with every matching having the same number of edges
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 9, 2016 at 8:57 | comment | added | user173856 | Shagnik: Thank you very much for your help! | |
| Jul 9, 2016 at 8:56 | comment | added | user173856 | Wolfgang: Yes, your edits agree with what I mean. Thank you! | |
| Jul 8, 2016 at 22:15 | comment | added | Shagnik | In the case when $k$ is linear in $n$, some sharp bounds are given by Fox, Huang and Sudakov: people.math.ethz.ch/~sudakovb/linear-induced-matchings.pdf | |
| Jul 8, 2016 at 17:36 | comment | added | Wolfgang | I guess you mean "Consider a bipartite graph H...". Can you please check if my edits agree with what you mean? | |
| Jul 8, 2016 at 17:34 | history | edited | Wolfgang | CC BY-SA 3.0 |
deleted 8 characters in body
|
| Jul 8, 2016 at 17:13 | history | edited | Wolfgang | CC BY-SA 3.0 |
added clarification
|
| Jul 8, 2016 at 14:48 | history | asked | user173856 | CC BY-SA 3.0 |