Results 111 to 120 of about 1,354,678 (274)
Analytic connectivity of k-uniform hypergraphs [PDF]
Linear and Multilinear Algebra, 2016 15 ...
Joshua Cooper, An Chang, W. Li
openaire +3 more sources
Balanced Independent Sets and Colorings of Hypergraphs
Journal of Graph Theory, Volume 109, Issue 1, Page 43-51, May 2025.ABSTRACT A k ‐uniform hypergraph H = ( V , E )
wiley +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
Colorful Subhypergraphs in Uniform Hypergraphs
The Electronic Journal of Combinatorics, 2017 There are several topological results ensuring in any properly colored graph the existence of a colorful complete bipartite subgraph, whose order is bounded from below by some topological invariants of some topological spaces associated to the graph. Meunier [Colorful subhypergraphs in Kneser hypergraphs, The Electronic Journal of Combinatorics, 2014 ...
openaire +3 more sources
The α-Arboricity of Complete Uniform Hypergraphs [PDF]
SIAM Journal on Discrete Mathematics, 2011 $\alpha$-Acyclicity is an important notion in database theory. The $\alpha$-arboricity of a hypergraph H is the minimum number of $\alpha$-acyclic hypergraphs that partition the edge set of H. The $\alpha$-arboricity of the complete 3-uniform hypergraph is determined completely.
Bermond, Jean-Claude +3 more
openaire +3 more sources
Transactions in GIS, Volume 29, Issue 3, May 2025.ABSTRACT Mobility behavior research has long been a focal point in geographic information science (GIS). Many researchers use isolated OD pairs as flow analysis units when studying mobility behavior based on OD (origin–destination) data. However, isolated OD pairs only reflect individual mobility, which may constrain applying a collective analytical ...
Rui Xin +4 more
wiley +1 more source
Hypergraph removal lemmas via robust sharp threshold theorems
Discrete Analysis, 2020 Hypergraph removal lemmas via robust sharp threshold theorems, Discrete Analysis 2020:10, 46 pp. A central result in additive and extremal combinatorics is the triangle removal lemma, which roughly speaking states that a graph with few triangles can be ...
Noam Lifshitz
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
Hypergraphs with infinitely many extremal constructions
Discrete Analysis, 2023 Hypergraphs with infinitely many extremal constructions, Discrete Analysis 2023:18, 34 pp. A fundamental result in extremal graph theory, Turán's theorem, states that the maximal number of edges of a graph with $n$ vertices that does not contain a ...
Jianfeng Hou +4 more
doaj +1 more source
Linear trees in uniform hypergraphs
European Journal of Combinatorics, 2014 Given a tree T on v vertices and an integer k exceeding one. One can define the k-expansion T^k as a k-uniform linear hypergraph by enlarging each edge with a new, distinct set of (k-2) vertices. Then T^k has v+ (v-1)(k-2) vertices. The aim of this paper is to show that using the delta-system method one can easily determine asymptotically the size of ...
openaire +3 more sources