Results 41 to 50 of about 40,185 (227)
Entropic measure and hypergraph states
, 2013 We investigate some properties of the entanglement of hypergraph states in purely hypergraph theoretical terms. We first introduce an approach for computing local entropic measure on qubit t of a hypergraph state by using the Hamming weight of the so ...
Bao, Yan-ru +4 more
core +1 more source
On edge-sets of bicliques in graphs [PDF]
, 2012 A biclique is a maximal induced complete bipartite subgraph of a graph. We investigate the intersection structure of edge-sets of bicliques in a graph. Specifically, we study the associated edge-biclique hypergraph whose hyperedges are precisely the edge-
Groshaus, Marina +2 more
core +2 more sources
Discrete Applied Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hanns-Martin Teichert, Martin Sonntag
openaire +3 more sources
Toric algebra of hypergraphs [PDF]
, 2013 The edges of any hypergraph parametrize a monomial algebra called the edge subring of the hypergraph. We study presentation ideals of these edge subrings, and describe their generators in terms of balanced walks on hypergraphs.
Petrović, Sonja, Stasi, Despina
core +1 more source
European Journal of Combinatorics, 2001 Formulas for the cycle index of the representation of the symmetric group of degree \(n\) acting on all subsets of the object set are derived and applied through \(n=7\). These can be used to enumerate hypergraphs with Pólya's enumeration theorem. The approach is similar to that of \textit{E. M. Palmer} [Discrete Math. 6, 377-390 (1973; Zbl 0269.05110)]
Tōru Ishihara
openalex +4 more sources
Lagrangians of Hypergraphs [PDF]
Combinatorics, Probability and Computing, 2002 How large can the Lagrangian of an r-graph with m edges be? Frankl and Füredi [1] conjectured that the r-graph of size m formed by taking the first m sets in the colex ordering of N(r) has the largest Lagrangian of all r-graphs of size m. We prove the first ‘interesting’ case of this conjecture, namely that the 3-graph with (t3) edges and ...
John Talbot
openalex +4 more sources
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
Beaudou, Laurent +7 more
openaire +3 more sources
EngineeringPractical real-world scenarios such as the Internet, social networks, and biological networks present the challenges of data scarcity and complex correlations, which limit the applications of artificial intelligence. The graph structure is a typical tool
Yue Gao +3 more
doaj +1 more source
Hypergraph Modelling for Geometric Model Fitting
, 2016 In this paper, we propose a novel hypergraph based method (called HF) to fit and segment multi-structural data. The proposed HF formulates the geometric model fitting problem as a hypergraph partition problem based on a novel hypergraph model.
Lai, Taotao +3 more
core +1 more source
Extreme violation of local realism in quantum hypergraph states
, 2016 Hypergraph states form a family of multiparticle quantum states that generalizes the well-known concept of Greenberger-Horne-Zeilinger states, cluster states, and more broadly graph states.
Budroni, Costantino +2 more
core +1 more source