Results 91 to 100 of about 698,372 (216)
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
Transversal numbers of uniform hypergraphs
Graphs and Combinatorics, 1990 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
A note on self-complementary 4-uniform hypergraphs [PDF]
Opuscula Mathematica, 2005 We prove that a permutation \(\theta\) is complementing permutation for a \(4\)-uniform hypergraph if and only if one of the following cases is satisfied: (i) the length of every cycle of \(\theta\) is a multiple of \(8\), (ii) \(\theta\) has \(1\), \(2\)
Artur Szymański
doaj
Constrained Colouring and σ-Hypergraphs
Discussiones Mathematicae Graph Theory, 2015 A constrained colouring or, more specifically, an (α, β)-colouring of a hypergraph H, is an assignment of colours to its vertices such that no edge of H contains less than α or more than β vertices with different colours.
Caro Yair, Lauri Josef, Zarb Christina
doaj +1 more source
Regular subgraphs of uniform hypergraphs
Journal of Combinatorial Theory, Series B, 2016 We prove that for every integer $r\geq 2$, an $n$-vertex $k$-uniform hypergraph $H$ containing no $r$-regular subgraphs has at most $(1+o(1)){{n-1}\choose{k-1}}$ edges if $k\geq r+1$ and $n$ is sufficiently large. Moreover, if $r\in\{3,4\}$, $r\mid k$ and $k,n$ are both sufficiently large, then the maximum number of edges in an $n$-vertex $k$-uniform ...
openaire +5 more sources
Hypergraph Independent Sets [PDF]
, 2013 The study of extremal problems related to independent sets in hypergraphs is a problem that has generated much interest. There are a variety of types of independent sets in hypergraphs depending on the number of vertices from an independent set allowed ...
A. J. Radcliffe +3 more
core +1 more source
Matchings in 3-uniform hypergraphs
Journal of Combinatorial Theory, Series B, 2013 We determine the minimum vertex degree that ensures a perfect matching in a 3-uniform hypergraph. More precisely, suppose that H is a sufficiently large 3-uniform hypergraph whose order n is divisible by 3. If the minimum vertex degree of H is greater than \binom{n-1}{2}-\binom{2n/3}{2}, then H contains a perfect matching.
Daniela Kühn +2 more
openaire +3 more sources
Fixation probability for different hypergraph models under model 2.
, 2023 We compare the Moran process, which is the baseline, complete 3-uniform hypergraphs, cyclic 3-uniform hypergraphs, and star 3-uniform hypergraphs. (A) N = 4. (B) N = 5. (C) N = 20. (D) N = 200.
Naoki Masuda (82398) +1 more
core +1 more source
Partitioning 3-uniform hypergraphs
Journal of Combinatorial Theory, Series B, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jie Ma 0002, Xingxing Yu
openaire +2 more sources
Hypergraphs with Pendant Paths are not Chromatically Unique
Discussiones Mathematicae Graph Theory, 2014 In this note it is shown that every hypergraph containing a pendant path of length at least 2 is not chromatically unique. The same conclusion holds for h-uniform r-quasi linear 3-cycle if r ≥ 2.
Tomescu Ioan
doaj +1 more source