Results 121 to 130 of about 1,981 (215)
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 +2 more sources
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 +1 more source
One Turán Type Problem on Uniform Hypergraphs
AxiomsLet n,m,p,r∈N with p≥n≥r. For a hypergraph, if each edge has r vertices, then the hypergraph is called an r-graph. Define er(n,m;p) to be the maximum number of edges of an r-graph with p vertices in which every subgraph of n vertices has at most m edges.
Linlin Wang, Sujuan Liu
doaj +1 more source
The chromatic spectrum of 3-uniform bi-hypergraphs [PDF]
, 2011 Let S={n1,n2,…,nt} be a finite set of positive integers with minS≥3 and t≥2. For any positive integers s1,s2,…,st, we construct a family of 3-uniform bi-hypergraphs H with the feasible set S and rni=si,i=1,2,…,t, where each rni is the nith component of ...
Zhao, Ping +5 more
core +1 more source
Vertex-degree-based topological indices of uniform directed hypergraphs
Arab Journal of Basic and Applied SciencesModelling a chemical network is crucial for understanding the complex interactions and dynamics within a chemical system, allowing for precise predictions of reaction behaviour under various conditions.
Shashwath S. Shetty, K. Arathi Bhat
doaj +1 more source
Coloring d-embeddable k-uniform hypergraphs [PDF]
, 2014 This paper extends the scenario of the Four Color Theorem in the following way. Let Hd,k be the set of all k-uniform hypergraphs that can be (linearly) embedded into Rd.
Taraz, Anusch +3 more
core
On the number of $\mathcal {H}$ -free hypergraphs
Forum of Mathematics, SigmaTwo central problems in extremal combinatorics are concerned with estimating the number $\mathrm {ex}(n,\mathcal {H})$ , the size of the largest $\mathcal {H}$ -free hypergraph on n vertices, and the number $\mathrm {forb}(n,\mathcal {H})$
Tao Jiang, Sean Longbrake
doaj +1 more source
Asymptotic Sharpness of Bounds on Hypertrees
Discussiones Mathematicae Graph Theory, 2017 The hypertree can be defined in many different ways. Katona and Szabó introduced a new, natural definition of hypertrees in uniform hypergraphs and investigated bounds on the number of edges of the hypertrees.
Lin Yi, Kang Liying, Shan Erfang
doaj +1 more source
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
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 +4 more sources