A general comment here is that a hypergraph is an absurdly general object; it's basically an element of the power set of the power set of a set. For example, topologies and measurable …

Jun 19, 2020 · One property is the 2-colorability, but here, one demands that every subhypergraph is 2-colorable. Another possibility is to forbid certain kind of odd cycles (called …

Jul 28, 2020 · In the paper Hall's theorem for hypergraphs (Aharoni and Haxell, 2000), the authors prove a theorem on the existence of perfect matchings in bipartite hypergraphs, using …

Feb 18, 2020 · Is there any way to find a minimal circuit basis for 3-uniform hypergraphs efficiently? What if we put additional conditions on the 3-uniform graph?

Nov 5, 2024 · The key issue with extending this approach to hypergraphs is that the bad parts could be adjacent. So the argument for "intersection is ≥ n ≥ n " doesn't go through. I don't …

Dec 26, 2023 · However, as the hypergraphs will be just isomorphic but have different vertex/edge labels, we need to compute a canonical representation of the hypergraph at each …

Mar 7, 2019 · In a note concerning a version of Hadwiger's conjecture for hypergraphs, I once defined what a (complete) minor map of a hypergraph is, and probably this can be used to …

The complexity of the problem is investigated in "Neighborhood hypergraphs of bipartite graphs" by Boros, Gurvich and Zverovich. They mention that the general formulations are NP-complete …

Sep 3, 2023 · Consider two undirected k k -regular hypergraphs on n n vertices with (see e.g. OEIS A319190). Are the two hypergraphs isomorphic if an only if the two multisets of the sizes …

May 14, 2015 · Here is a 3-regular 3-partite 3-uniform hypergraph with 3 vertices in each part having no perfect matching. This example generalizes in a straightforward way to give a d d …