Results 11 to 20 of about 1,639 (93)

Almost Self-Complementary 3-Uniform Hypergraphs

Discussiones Mathematicae Graph Theory, 2017
It is known that self-complementary 3-uniform hypergraphs on n vertices exist if and only if n is congruent to 0, 1 or 2 modulo 4. In this paper we define an almost self-complementary 3-uniform hypergraph on n vertices and prove that it exists if and ...
Kamble Lata N., Deshpande Charusheela M., Bam Bhagyashree Y.   +2 more
doaj   +1 more source

Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses [PDF]

, 2013
We present a series of almost settled inapproximability results for three fundamental problems. The first in our series is the subexponential-time inapproximability of the maximum independent set problem, a question studied in the area of parameterized ...
Chalermsook, Parinya, Laekhanukit, Bundit, Nanongkai, Danupon   +2 more
core   +1 more source

An approximate version of Sidorenko's conjecture [PDF]

, 2010
A beautiful conjecture of Erd\H{o}s-Simonovits and Sidorenko states that if H is a bipartite graph, then the random graph with edge density p has in expectation asymptotically the minimum number of copies of H over all graphs of the same order and edge ...
Conlon, David, Fox, Jacob, Sudakov, Benny   +2 more
core   +5 more sources

Decomposing tournaments into paths

Proceedings of the London Mathematical Society, Volume 121, Issue 2, Page 426-461, August 2020., 2020
Abstract We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from 1976. Kelly's conjecture states that every regular tournament has an edge decomposition into Hamilton cycles, and this was proved by Kühn and Osthus for large tournaments. The conjecture of Alspach, Mason, and Pullman asks for the minimum number
Allan Lo, Viresh Patel, Jozef Skokan, John Talbot   +3 more
wiley   +1 more source

Characterization of the degree sequences of (quasi) regular uniform hypergraphs

, 2013
In hypergraph theory, determining a characterization of the degree sequence $d=(d_1,d_2,\ldots,d_n)$ where $d_1\ge d_2\ge\ldots,d_n$ are positive integers, of an $h$-uniform simple hypergraph $\cal H$, and deciding the complexity status of the reconstruction of $\cal H$ from $d$, are two challenging open problems.
Frosini, A., Picouleau, Christophe, Rinaldi, S.   +2 more
openaire   +3 more sources

Embeddings and Ramsey numbers of sparse k-uniform hypergraphs

, 2008
Chvatal, Roedl, Szemeredi and Trotter proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In previous work, we proved the same result for 3-uniform hypergraphs. Here we extend this result to k-uniform hypergraphs,
Cooley, Oliver, Fountoulakis, Nikolaos, Kühn, Daniela, Osthus, Deryk   +3 more
core   +2 more sources

Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs [PDF]

, 2013
This work revisits the PCP Verifiers used in the works of Hastad [Has01], Guruswami et al.[GHS02], Holmerin[Hol02] and Guruswami[Gur00] for satisfiable Max-E3-SAT and Max-Ek-Set-Splitting, and independent set in 2-colorable 4-uniform hypergraphs.
Saket, Rishi
core   +1 more source

Woven Graph Codes: Asymptotic Performances and Examples

, 2008
Constructions of woven graph codes based on constituent block and convolutional codes are studied. It is shown that within the random ensemble of such codes based on $s$-partite, $s$-uniform hypergraphs, where $s$ depends only on the code rate, there ...
Bocharova, Irina E., Johannesson, Rolf, Kudryashov, Boris D., Zyablov, Victor V.   +3 more
core   +3 more sources

Finite reflection groups and graph norms [PDF]

, 2017
Given a graph $H$ on vertex set $\{1,2,\cdots, n\}$ and a function $f:[0,1]^2 \rightarrow \mathbb{R}$, define \begin{align*} \|f\|_{H}:=\left\vert\int \prod_{ij\in E(H)}f(x_i,x_j)d\mu^{|V(H)|}\right\vert^{1/|E(H)|}, \end{align*} where $\mu$ is the ...
Conlon, David, Lee, Joonkyung
core   +3 more sources

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