Results 1 to 10 of about 118 (93)
Discussiones Mathematicae Graph Theory, 2017 We characterize the class L32$L_3^2 $ of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 by means of a finite list of forbidden induced subgraphs in the class of threshold graphs.
Metelsky Yury +2 more
doaj +2 more sources
Neighborhood hypergraph model for topological data analysis
Computational and Mathematical Biophysics, 2022 Hypergraph, as a generalization of the notions of graph and simplicial complex, has gained a lot of attention in many fields. It is a relatively new mathematical model to describe the high-dimensional structure and geometric shapes of data sets.
Liu Jian, Chen Dong, Li Jingyan, Wu Jie
doaj +1 more source
Covering the Edges of a Random Hypergraph by Cliques
Discussiones Mathematicae Graph Theory, 2022 We determine the order of magnitude of the minimum clique cover of the edges of a binomial, r-uniform, random hypergraph G(r)(n, p), p fixed. In doing so, we combine the ideas from the proofs of the graph case (r = 2) in Frieze and Reed [Covering the ...
Rödl Vojtěch, Ruciński Andrzej
doaj +1 more source
Large hypergraphs without tight cycles [PDF]
, 2021 An \(r\)-uniform tight cycle of length \(\ell>r\) is a hypergraph with vertices \(v_1,\dots,v_\ell\) and edges \(\{v_i,v_{i+1},\dots,v_{i+r-1}\}\) (for all \(i\)), with the indices taken modulo \(\ell\). It was shown by Sudakov and Tomon that for each
Janzer, Barnabás
core +1 more source
Discussiones Mathematicae Graph Theory, 2022 In this corrigendum, we correct the proof of Theorem 10 from our paper titled „Bounds on the number of edges of edge-minimal, edge-maximal and l-hypertrees”.
Szabó Péter G.N.
doaj +1 more source
Disjoint dijoins for classes of dicuts in finite and infinite digraphs [PDF]
, 2022 A dicut in a directed graph is a cut for which all of its edges are directed to a common side of the cut. A famous theorem of Lucchesi and Younger states that in every finite digraph the least size of a set of edges meeting every non-empty dicut equals ...
Heuer, Karl +3 more
core +1 more source
On the distance energy of k-uniform hypergraphs
Special Matrices, 2023 In this article, we extend the concept of distance energy for hypergraphs. We first establish a relation between the distance energy and the distance spectral radius.
Sharma Kshitij, Panda Swarup Kumar
doaj +1 more source
Recursion Relations for Chromatic Coefficients for Graphs and Hypergraphs
Discussiones Mathematicae Graph Theory, 2022 We establish a set of recursion relations for the coefficients in the chromatic polynomial of a graph or a hypergraph. As an application we provide a generalization of Whitney’s broken cycle theorem for hypergraphs, as well as deriving an explicit ...
Durhuus Bergfinnur, Lucia Angelo
doaj +1 more source
Geometric representations of linear codes [PDF]
, 2010 We say that a linear code C over a field F is triangular representable if there exists a two dimensional simplicial complex ∆ such that C is a punctured code of the kernel ker∆ of the incidence matrix of ∆ over F and there is a linear mapping between C ...
Pavel Ryt'ivr
semanticscholar +1 more source
The signless Laplacian matrix of hypergraphs
Special Matrices, 2022 In this article, we define signless Laplacian matrix of a hypergraph and obtain structural properties from its eigenvalues. We generalize several known results for graphs, relating the spectrum of this matrix to structural parameters of the hypergraph ...
Cardoso Kauê, Trevisan Vilmar
doaj +1 more source