Results 91 to 100 of about 1,981 (215)
Intersection Graphs of k-Uniform Hypergraphs [PDF]
, 1980 Some recent result of authors and others on characterizations of intersection graphs of κ-uniform hypergraphs are ...
Singhi, N. M. +7 more
core +1 more source
Construction of S(3) (2, 3)-Designs of Any Index
MathematicsLet H(3) be a uniform hypergraph of rank 3. A hyperstar S(3)(2,3) of centre C={x,y} is a 3-uniform hypergraph with three hyperedges, all having the centre C={x,y} in common, with x and y of degree 3 and the remaining vertices of degree 1.
Antonio Causa +2 more
doaj +1 more source
A note on a list colouring of hypergraphs [PDF]
Opuscula Mathematica, 2004 In the note we present two results. The first of them gives a sufficient condition for a colouring of a hypergraph from an assigned list. It generalises the analogous fact for graphs.
Ewa Drgas-Burchardt
doaj
Super edge-magic labeling of m-node k-uniform hyperpaths and m-node k-uniform hypercycles
AKCE International Journal of Graphs and Combinatorics, 2016 We generalize the notion of the super edge-magic labeling of graphs to the notion of the super edge-magic labeling of hypergraphs. For a hypergraph H with a finite vertex set V and a hyperedge set E, a bijective function f:V∪E→{1,2,3,…,|V|+|E|} is called
Ratinan Boonklurb +2 more
doaj +1 more source
Journal of the London Mathematical Society, Volume 114, Issue 1, July 2026.Abstract Dedekind's problem, dating back to 1897, asks for the total number ψ(n)$\psi (n)$ of antichains contained in the Boolean lattice Bn$B_n$ on n$n$ elements. We study Dedekind's problem using a recently developed method based on the cluster expansion from statistical physics, and as a result, obtain several new results on the number and typical ...
Matthew Jenssen +2 more
wiley +1 more source
Existential closure in uniform hypergraphs
Discrete MathematicsFor a positive integer $n$, a graph with at least $n$ vertices is $n$-existentially closed or simply $n$-e.c. if for any set of vertices $S$ of size $n$ and any set $T\subseteq S$, there is a vertex $x\not\in S$ adjacent to each vertex of $T$ and no vertex of $S\setminus T$.
Andrea C. Burgess +2 more
openaire +2 more sources
Judicious partitions of uniform hypergraphs [PDF]
Combinatorica, 2014 The vertices of any graph with $m$ edges may be partitioned into two parts so that each part meets at least $\frac{2m}{3}$ edges. Bollobás and Thomason conjectured that the vertices of any $r$-uniform hypergraph with $m$ edges may likewise be partitioned into $r$ classes such that each part meets at least $\frac{r}{2r-1}m$ edges. In this paper we prove
openaire +3 more sources
3-uniform hypergraphs and linear cycles [PDF]
Electronic Notes in Discrete Mathematics, 2017 Improved the writing, more explanation added and corrections ...
Beka Ergemlidze +2 more
openaire +3 more sources
Hypergraph Representation via Axis-Aligned Point-Subspace Cover [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe propose a new representation of $k$-partite, $k$-uniform hypergraphs, that is, a hypergraph with a partition of vertices into $k$ parts such that each hyperedge contains exactly one vertex of each type; we call them $k$-hypergraphs for short.
Oksana Firman, Joachim Spoerhase
doaj +1 more source
Identifiability of points and rigidity of hypergraphs under algebraic constraints
Journal of the London Mathematical Society, Volume 114, Issue 1, July 2026.Abstract The identifiability problem arises naturally in a number of contexts in mathematics and computer science. Specific instances include local or global rigidity of graphs and unique completability of partially‐filled tensors subject to rank conditions.
James Cruickshank +3 more
wiley +1 more source