Timeline for What is a hypergraph minor?
Current License: CC BY-SA 4.0
5 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 22, 2019 at 18:10 | answer | added | Dominic van der Zypen | timeline score: 0 | |
Apr 6, 2019 at 13:01 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
Mar 8, 2019 at 14:47 | comment | added | Arnaud | Arguably one of the baby steps of graph minor theory is the Wagner theorem on planar graphs. Already this is highly non-trivial for hypergraphs. Recent work of Carmesin has provided a finite list of forbidden minors (for some definition of minor) for the embeddability of simply-connected locally 3-connected 2-complexes in R^3, but there are infinite antichains when these hypotheses are lifted. Related notions of minor towards embedabillity have also been introduced by Nevo and Wagner | |
Mar 7, 2019 at 12:49 | answer | added | Carlo Beenakker | timeline score: 2 | |
Mar 7, 2019 at 9:52 | history | asked | domotorp | CC BY-SA 4.0 |