Timeline for Bipartiteness criterion
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 25, 2015 at 22:13 | history | edited | Tony Huynh | CC BY-SA 3.0 |
fixed math rendering
|
| Dec 23, 2012 at 20:46 | comment | added | Tony Huynh | You're welcome. Yes, this is not exactly what you are looking for, but it shows that such a characterization of bipartite hypergraphs in terms of lack of odd cycles will be tricky to come by. For example, the above theorem shows that hypergraphs with no odd cycles contain only a few edges, while bipartite hypergraphs can contain exponentially many edges. | |
| Dec 23, 2012 at 20:36 | comment | added | Seva | Thanks - good to know, but not exactly what I am looking for. The definition is that the vertices can be partitioned into two subsets so that no edge is monochromatic, and I need a criterion for this in the spirit of the familiar no-odd-cycles condition. | |
| Dec 23, 2012 at 19:20 | history | answered | Tony Huynh | CC BY-SA 3.0 |