Results 61 to 70 of about 1,405,425 (255)
International Journal of Mathematics and Mathematical Sciences, 2005 In 1986, Johnson and Perry proved a class of inequalities for uniform hypergraphs which included the following: for any such hypergraph, the geometric mean over the hyperedges of the geometric means of the degrees of the nodes on the hyperedge is no less
P. D. Johnson, R. N. Mohapatra
doaj +1 more source
On the α-Spectral Radius of Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2020 For 0 ≤ α ---lt--- 1 and a uniform hypergraph G, the α-spectral radius of G is the largest H-eigenvalue of αD(G)+(1−α)A(G), where D(G) and A(G) are the diagonal tensor of degrees and the adjacency tensor of G, respectively. We give upper bounds for the α-
Guo Haiyan, Zhou Bo
doaj +1 more source
Coloring $$d$$ d -Embeddable $$k$$ k -Uniform Hypergraphs [PDF]
Discrete & Computational Geometry, 2013 18 ...
Carl Georg Heise +3 more
openaire +4 more sources
Rainbow connection numbers of some classes of s-overlapping r-uniform hypertrees with size t
AIMS MathematicsThe rainbow connection concept was developed to determine the minimum number of passwords required to exchange encrypted information between two agents. If the information exchange involves divisions managing more than two agents, the rainbow connection ...
Sitta Alief Farihati +2 more
doaj +1 more source
Sierpiński products of r-uniform hypergraphs
The Art of Discrete and Applied Mathematics, 2022 Summary: If \(H_1\) and \(H_2\) are \(r \)-uniform hypergraphs and \(f\) is a function from the set of all \((r - 1)\)-element subsets of \(V(H_1)\) into \(V(H_2)\), then the Sierpiński product \(H_1 \otimes_f H_2\) is defined to have vertex set \(V(H_1) \times V(H_2)\) and hyperedges falling into two classes: \[ (g, h_1) (g, h_2) \cdots (g, h_r ...
Budden, Mark, Hiller, Josh
openaire +2 more sources
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes
, 2013 We prove improved inapproximability results for hypergraph coloring using the low-degree polynomial code (aka, the 'short code' of Barak et. al. [FOCS 2012]) and the techniques proposed by Dinur and Guruswami [FOCS 2013] to incorporate this code for ...
Guruswami, Venkatesan +4 more
core +1 more source
Clique-symmetric uniform hypergraphs
Matemática Contemporânea, 2003 Summary: Let \(H\) be an \(r\)-uniform hypergraph of order \(p\), and \(\{H_{p1}, H_{p2},\dots\}\) be a countable sequence of \(r\)-uniform hypergrapbs with \(H_{pn}\) having \(pn\) vertices. The sequence is \(H\)-removable if \(H_{p1}\cong H\) and \(H_{pn}- S\cong H_{p(n-1)}\) where \(S\) is any vertex subset of \(H_{pn}\) that induces a copy of \(H\).
McSorley, John P, Porter, Thomas
openaire +3 more sources
On a generalisation of Mantel's theorem to uniformly dense hypergraphs
, 2017 For a $k$-uniform hypergraph $F$ let $\textrm{ex}(n,F)$ be the maximum number of edges of a $k$-uniform $n$-vertex hypergraph $H$ which contains no copy of $F$.
Reiher, Christian +2 more
core +1 more source
More Results on The Smallest One-Realization of A Given Set II
Discussiones Mathematicae Graph Theory, 2019 Let S be a finite set of positive integers. A mixed hypergraph ℋ is a onerealization of S if its feasible set is S and each entry of its chromatic spectrum is either 0 or 1.
Diao Kefeng, Lu Fuliang, Zhao Ping
doaj +1 more source
Judiciously 3‐partitioning 3‐uniform hypergraphs [PDF]
Random Structures & Algorithms, 2020 Bollobás, Reed, and Thomason proved every 3‐uniform hypergraph ℋ with m edges has a vertex‐partition V()=V1⊔V2⊔V3 such that each part meets at least edges, later improved to 0.6m by Halsegrave and improved asymptotically to 0.65m+o(m) by Ma and Yu. We improve this asymptotic bound to , which is best possible up to the error term, resolving a special ...
Spink, Hunter, Tiba, Marius
openaire +3 more sources