Results 81 to 90 of about 11,596 (195)
On judicious partitions of uniform hypergraphs
Journal of Combinatorial Theory, Series A, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianfeng Hou, Shufei Wu, Guiying Yan
openaire +1 more source
Hamiltonicity and $\sigma$-hypergraphs
Theory and Applications of Graphs, 2014 We define and study a special type of hypergraph. A $\sigma$-hypergraph $H= H(n,r,q$ $\mid$ $\sigma$), where $\sigma$ is a partition of $r$, is an $r$-uniform hypergraph having $nq$ vertices partitioned into $ n$ classes of $q$ vertices each.
Christina Zarb
doaj +1 more source
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes
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 +2 more sources
Discrepancy of arithmetic progressions in boxes and convex bodies
Mathematika, Volume 72, Issue 2, April 2026.Abstract The combinatorial discrepancy of arithmetic progressions inside [N]:={1,…,N}$[N]:= \lbrace 1, \ldots, N\rbrace$ is the smallest integer D$D$ for which [N]$[N]$ can be colored with two colors so that any arithmetic progression in [N]$[N]$ contains at most D$D$ more elements from one color class than the other.
Lily Li, Aleksandar Nikolov
wiley +1 more source
Constrained Colouring and σ-Hypergraphs
Discussiones Mathematicae Graph Theory, 2015 A constrained colouring or, more specifically, an (α, β)-colouring of a hypergraph H, is an assignment of colours to its vertices such that no edge of H contains less than α or more than β vertices with different colours.
Caro Yair, Lauri Josef, Zarb Christina
doaj +1 more source
f$f$‐Diophantine sets over finite fields via quasi‐random hypergraphs from multivariate polynomials
Mathematika, Volume 72, Issue 2, April 2026.Abstract We investigate f$f$‐Diophantine sets over finite fields via new explicit constructions of families of quasi‐random hypergraphs from multivariate polynomials. In particular, our construction not only offers a systematic method for constructing quasi‐random hypergraphs but also provides a unified framework for studying various hypergraphs ...
Seoyoung Kim, Chi Hoi Yip, Semin Yoo
wiley +1 more source
Independence in 5-uniform hypergraphs
Discrete Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alex Eustis +2 more
openaire +2 more sources
Cognitive Networks for Knowledge Modeling: A Gentle Introduction for Data‐ and Cognitive Scientists
WIREs Cognitive Science, Volume 17, Issue 2, March/April 2026.Cognitive network science helps organize associative knowledge—that is, the connections between concepts. These connections play a key role in cognitive processes such as language understanding and context interpretation, even though they are not obvious in language use.
Edith Haim, Massimo Stella
wiley +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
On a generalisation of Mantel's theorem to uniformly dense hypergraphs
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 +2 more sources