Results 71 to 80 of about 538 (183)

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, Authawich Narissayaporn, Sirirat Singhun   +2 more
doaj   +1 more source

Metric spaces with small rough angles and the rectifiability of rough self‐contracted curves

Journal of the London Mathematical Society, Volume 114, Issue 3, September 2026.
Abstract The small rough angle (SRA$\operatorname{SRA}$) condition, introduced by Zolotov in arXiv:1804.00234, captures the idea that all angles formed by triples of points in a metric space are small. In the first part of the paper, we develop the theory of metric spaces (X,d)$(X,d)$ satisfying the SRA(α)$\operatorname{SRA}(\alpha)$ condition for some
Estibalitz Durand Cartagena, Jeremy T. Tyson   +1 more
wiley   +1 more source

3-uniform hypergraphs and linear cycles [PDF]

Electronic Notes in Discrete Mathematics, 2017
Improved the writing, more explanation added and corrections ...
Beka Ergemlidze, Ervin Györi, Abhishek Methuku   +2 more
openaire   +5 more sources

Hypergraph Representation via Axis-Aligned Point-Subspace Cover [PDF]

Discrete Mathematics & Theoretical Computer Science
We 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

Topology‐Aware Deep Learning on Higher‐Order Structures for Drug Response Prediction

Advanced Science, Volume 13, Issue 46, 17 August 2026.
We present TopDr, a topology‐aware deep learning framework that encodes both drugs and cell lines as multiscale simplicial complexes, capturing interactions at the 0‐, 1‐, and 2‐simplex levels. By jointly integrating local higher‐order neighborhoods and global topological structures, TopDr generates enriched representations for sensitivity prediction ...
Cong Shen, Guancen Lin, Chuan‐Shen Hu, Yong Wang   +3 more
wiley   +1 more source

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

Asymmetric Results About Graph Homomorphisms

Random Structures &Algorithms, Volume 69, Issue 1, August 2026.
ABSTRACT Many important results in extremal graph theory can be roughly summarized as “if a triangle‐free graph G$$ G $$ has certain properties, then it has a homomorphism to a triangle‐free graph Γ$$ \Gamma $$ of bounded size.” For example, bounds on homomorphism thresholds give such a statement if G$$ G $$ has sufficiently high minimum degree, and ...
Lior Gishboliner, Eoin Hurley, Yuval Wigderson   +2 more
wiley   +1 more source

The number of regular simplices in higher dimensions

Bulletin of the London Mathematical Society, Volume 58, Issue 8, August 2026.
Abstract We study the extremal function Sdk(n)$S^k_d(n)$, defined as the maximum number of regular (k−1)$(k-1)$‐simplices spanned by n$n$ points in Rd$\mathbb {R}^d$. For any fixed d⩾2k⩾6$d\geqslant 2k\geqslant 6$, we determine the asymptotic behavior of Sdk(n)$S^k_d(n)$ up to a lower‐order term.
Felix Christian Clemen, Adrian Dumitrescu, Dingyuan Liu   +2 more
wiley   +1 more source

Chromatic Polynomials Of Some (m,l)-Hyperwheels [PDF]

Computer Science Journal of Moldova, 2014
In this paper, using a standard method of computing the chromatic polynomial of hypergraphs, we introduce a new reduction theorem which allows us to find explicit formulae for the chromatic polynomials of some (complete) non-uniform $(m,l)-$hyperwheels ...
Julian A. Allagan
doaj  

Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings

Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.
Abstract In 1973, Erdős conjectured the existence of high girth (n,3,2)$(n,3,2)$‐Steiner systems. Recently, Glock, Kühn, Lo, and Osthus and independently Bohman and Warnke proved the approximate version of Erdős' conjecture. Recently, Kwan, Sah, Sawhney, and Simkin proved Erdős' conjecture.
Michelle Delcourt, Luke Postle
wiley   +1 more source