Results 1 to 10 of about 59 (56)

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

Discussiones 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., Deshpande Charusheela M., Bam Bhagyashree Y.   +2 more
doaj   +4 more sources

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   +2 more sources

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

, 2021
International audienceIn 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 ...
Frosini A., Frosini, A., Rinaldi S., Rinaldi, S., Picouleau C., Picouleau, Christophe   +5 more
core   +1 more source

Hypergraphs, Quasi-randomness, and Conditions for Regularity

Journal 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, Vojtech Rödl, Jozef Skokan   +2 more
openaire   +2 more sources

Extremal hypergraph theory and algorithmic regularity lemma for sparse graphs [PDF]

, 2011
Einst als Hilfssatz für Szemerédis Theorem entwickelt, hat sich das Regularitätslemma in den vergangenen drei Jahrzehnten als eines der wichtigsten Werkzeuge der Graphentheorie etabliert. Im Wesentlichen hat das Lemma zum Inhalt, dass dichte Graphen
Hàn, Hiêp
core   +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

PERSISTENT HYPERDIGRAPH HOMOLOGY AND PERSISTENT HYPERDIGRAPH LAPLACIANS. [PDF]

Found Data Sci, 2023
Chen D, Liu J, Wu J, Wei GW.
europepmc   +1 more source

Multistability, intermittency, and hybrid transitions in social contagion models on hypergraphs. [PDF]

Nat Commun, 2023
Ferraz de Arruda G, Petri G, Rodriguez PM, Moreno Y.   +3 more
europepmc   +1 more source

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

Nat Comput Sci, 2021
Huang C, Zhang F, Newman M, Ni X, Ding D, Cai J, Gao X, Wang T, Wu F, Zhang G, Ku HS, Tian Z, Wu J, Xu H, Yu H, Yuan B, Szegedy M, Shi Y, Zhao HH, Deng C, Chen J.   +20 more
europepmc   +1 more source

Algebras, Graphs and Ordered Sets - ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet. [PDF]

Order (Dordr), 2023
Couceiro M, Duffus D.
europepmc   +1 more source