Results 101 to 110 of about 1,405,425 (255)
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
Finite models for positive combinatorial and exponential algebra
Bulletin of the London Mathematical Society, Volume 57, Issue 11, Page 3380-3400, November 2025.Abstract We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of non‐negative integers whose equational theory has no finite axiomatisation, and show this also holds if factorial, fixed base exponentiation and operations for binomial coefficients are adjoined.
Tumadhir Alsulami, Marcel Jackson
wiley +1 more source
Unsupervised hyperlink prediction based on hypergraph random walk
Complex & Intelligent SystemsConventional link prediction methods mainly aim to estimate pairwise relationships between nodes in graph structures, typically addressing single-type interactions.
Yanlin Yang +5 more
doaj +1 more source
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
Partitioning 3-uniform hypergraphs
Journal of Combinatorial Theory, Series B, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ma, Jie, Yu, Xingxing
openaire +1 more source
Journal of Graph Theory, Volume 110, Issue 1, Page 82-91, September 2025.ABSTRACT An inversion of a tournament T is obtained by reversing the direction of all edges with both endpoints in some set of vertices. Let inv k ( T ) be the minimum length of a sequence of inversions using sets of size at most k that result in the transitive tournament.
Raphael Yuster
wiley +1 more source
Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture [PDF]
, 2021 Georg Anegg +2 more
openalex +1 more source
Homogeneous Multigrid for Hybrid Discretizations: Application to HHO Methods
Numerical Methods for Partial Differential Equations, Volume 41, Issue 5, September 2025.ABSTRACT We prove the uniform convergence of the geometric multigrid V‐cycle for hybrid high‐order (HHO) and other discontinuous skeletal methods. Our results generalize previously established results for HDG methods, and our multigrid method uses standard smoothers and local solvers that are bounded, convergent, and consistent.
Daniele A. Di Pietro +4 more
wiley +1 more source
Families of triples with high minimum degree are hamiltonian
Discussiones Mathematicae Graph Theory, 2014 In this paper we show that every family of triples, that is, a 3-uniform hypergraph, with minimum degree at least contains a tight Hamiltonian ...
Rödl Vojtech, Ruciński Andrzej
doaj +1 more source
EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS
Forum of Mathematics, Sigma, 2015 Let $p(k)$ denote the partition function of $k$. For each $k\geqslant 2$, we describe a list of $p(k)-1$ quasirandom properties that a $k$-uniform hypergraph can have. Our work connects previous notions on linear hypergraph quasirandomness by Kohayakawa,
JOHN LENZ, DHRUV MUBAYI
doaj +1 more source