Results 31 to 40 of about 7,886 (170)
Prime splittings of Determinantal Ideals [PDF]
, 2017 We consider determinantal ideals, where the generating minors are encoded in a hypergraph. We study when the generating minors form a Gr\"obner basis.
Mohammadi, Fatemeh, Rauh, Johannes
core +2 more sources
Transversals in regular uniform hypergraphs
Journal of Graph Theory, 2023 AbstractThe transversal number of a hypergraph is the minimum number of vertices that intersect every edge of . This notion of transversal is fundamental in hypergraph theory and has been studied a great deal in the literature. A hypergraph is ‐regular if every vertex of has degree , that is, every vertex of belongs to exactly edges. Further, is
Michael A. Henning, Anders Yeo
openaire +2 more sources
Degrees and regularity of intuitionistic fuzzy semihypergraphs [PDF]
Notes on IFSThis research work takes a new paradigm on the hypergraph concept which is a combination of a hypergraph and a semigraph. A semihypergraph is a connected hypergraph in which each hyperedge must have at least three vertices and any two hyperedges have at ...
K. K. Myithili, P. Nithyadevi
doaj +1 more source
International Journal of Mathematics and Mathematical Sciences, 2005 In 1986, Johnson and Perry proved a class of inequalities for uniform hypergraphs which included the following: for any such hypergraph, the geometric mean over the hyperedges of the geometric means of the degrees of the nodes on the hyperedge is no less
P. D. Johnson, R. N. Mohapatra
doaj +1 more source
Non-Abelian Topological Approach to Non-Locality of a Hypergraph State
Entropy, 2015 We present a theoretical study of new families of stochastic complex information modules encoded in the hypergraph states which are defined by the fractional entropic descriptor.
Vesna Berec
doaj +1 more source
The minimum vertex degree for an almost-spanning tight cycle in a $3$-uniform hypergraph [PDF]
, 2016 We prove that any $3$-uniform hypergraph whose minimum vertex degree is at least $\left(\frac{5}{9} + o(1) \right)\binom{n}{2}$ admits an almost-spanning tight cycle, that is, a tight cycle leaving $o(n)$ vertices uncovered.
Cooley, Oliver, Mycroft, Richard
core +2 more sources
Regular Partitions of Hypergraphs: Regularity Lemmas
Combinatorics, Probability and Computing, 2007 Szemerédi's regularity lemma for graphs has proved to be a powerful tool with many subsequent applications. The objective of this paper is to extend the techniques developed by Nagle, Skokan, and the authors and obtain a stronger and more ‘user-friendly’ regularity lemma for hypergraphs.
Rödl, Vojtěch, Schacht, Mathias
openaire +2 more sources
Almost Self-Complementary 3-Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2017 It is known that self-complementary 3-uniform hypergraphs on n vertices exist if and only if n is congruent to 0, 1 or 2 modulo 4. In this paper we define an almost self-complementary 3-uniform hypergraph on n vertices and prove that it exists if and ...
Kamble Lata N. +2 more
doaj +1 more source
A characterization of testable hypergraph properties [PDF]
, 2017 We provide a combinatorial characterization of all testable properties of $k$-graphs (i.e. $k$-uniform hypergraphs). Here, a $k$-graph property $\mathbf{P}$ is testable if there is a randomized algorithm which makes a bounded number of edge queries and ...
Joos, Felix +3 more
core +2 more sources
The 1-2-3 Conjecture for Hypergraphs [PDF]
, 2016 A weighting of the edges of a hypergraph is called vertex-coloring if the weighted degrees of the vertices yield a proper coloring of the graph, i.e., every edge contains at least two vertices with different weighted degrees.
Kalkowski, Maciej +2 more
core +2 more sources