Results 101 to 110 of about 8,099 (222)
Interval hypergraphs and D-interval hypergraphs
Discrete Mathematics, 1977 AbstractA hypergraph H = (V, E) is called an interval hypergraph if there exists a one-to-one function ƒ mapping the elements of V to points on the real line such that for each edge E, there is an interval I, containing the images of all elements of E, but not the images of any elements not in E1.
openaire +1 more source
Nonintersecting ryser hypergraphs
, 2020 A famous conjecture of Ryser states that every r-partite hypergraph has vertex cover number at most r 1 times the matching number. In recent years, hypergraphs meeting this conjectured bound, known as r-Ryser hypergraphs, have been studied extensively ...
Bishnoi A., Pepe V.
core +1 more source
Finding the K shortest hyperpaths using reoptimization [PDF]
The shortest hyperpath problem is an extension of the classical shortest path problem and has applications in many different areas. Recently, algorithms for finding the K shortest hyperpaths in a directed hypergraph have been developed by Andersen ...
Andersen, Kim Allan +2 more
core
Census and Analysis of Higher-Order Interactions in Real-World Hypergraphs
Big Data Mining and AnalyticsComplex systems can be more accurately described by higher-order interactions among multiple units. Hypergraphs excel at depicting these interactions, surpassing the binary limitations of traditional graphs.
Xihang Meng +4 more
doaj +1 more source
The complexity of recognizing $ABAB$-free hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe study of geometric hypergraphs gave rise to the notion of $ABAB$-free hypergraphs. A hypergraph $\mathcal{H}$ is called $ABAB$-free if there is an ordering of its vertices such that there are no hyperedges $A,B$ and vertices $v_1,v_2,v_3,v_4$ in this
Gábor Damásdi +3 more
doaj +1 more source
Some algebraic properties of hypergraphs [PDF]
, 1998 summary:We consider Stanley-Reisner rings $k[x_1,\ldots ,x_n]/I(\mathcal {H})$ where $I(\mathcal {H})$ is the edge ideal associated to some particular classes of hypergraphs.
Eric Emtander +7 more
core +1 more source
A note on self-complementary hypergraphs [PDF]
Opuscula Mathematica, 2005 In the paper we describe all self-complementary hypergraphs. It turns out that such hypergraphs exist if and only if the number of vertices of the hypergraph is of the form \(n=2^k\). This answers a conjecture posed by A.
Małgorzata Zwonek
doaj
On structures in hypergraphs of models of a theory
Қарағанды университетінің хабаршысы. Математика сериясы, 2018 Hypergraphs of models of a theory are derived objects allowing toobtain an essential structural information about both giventheories and related semantic objects including graph ones.
B.Sh. Kulpeshov, S.V. Sudoplatov
doaj +1 more source
Combinatorica, 2013 One of the De Bruijn - Erdos theorems deals with finite hypergraphs where every two vertices belong to precisely one hyperedge. It asserts that, except in the perverse case where a single hyperedge equals the whole vertex set, the number of hyperedges is at least the number of vertices and the two numbers are equal if and only if the hypergraph belongs
Laurent Beaudou +7 more
openaire +3 more sources