Results 1 to 10 of about 55 (54)

The Existence of Quasi Regular and Bi-Regular Self-Complementary 3-Uniform Hypergraphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
A k-uniform hypergraph H = (V ;E) is called self-complementary if there is a permutation σ : V → V , called a complementing permutation, such that for every k-subset e of V , e ∈ E if and only if σ(e) ∉ E. In other words, H is isomorphic with H′ = (V ; V(
Kamble Lata N.   +2 more
doaj   +3 more sources

Hypergraphs, Quasi-randomness, and Conditions for Regularity

open access: yesJournal of Combinatorial Theory, Series A, 2002
The study of quasi-randomness is a flourishing topic on uniform hypergraphs. F. R. K. Chung and R. L. Graham (among others) investigated thoroughly quasi-random uniform hypergraphs of density 1/2, showing a series of important equivalent statements about these structures. In this investigations the notion of deviation plays a central role.
Yoshiharu Kohayakawa   +2 more
openaire   +2 more sources

Almost Self-Complementary 3-Uniform Hypergraphs

open access: yesDiscussiones 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.   +2 more
doaj   +1 more source

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

open access: yes, 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.   +2 more
openaire   +3 more sources

Efficient parallelization of tensor network contraction for simulating quantum computation. [PDF]

open access: yesNat Comput Sci, 2021
Huang C   +20 more
europepmc   +1 more source

Monotone Circuit Lower Bounds from Robust Sunflowers. [PDF]

open access: yesAlgorithmica, 2022
Cavalar BP, Kumar M, Rossman B.
europepmc   +1 more source

Home - About - Disclaimer - Privacy