Results 31 to 40 of about 45 (45)

EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS

Forum of Mathematics, Sigma, 2015
Let $p(k)$ denote the partition function of $k$. For each $k\geqslant 2$, we describe a list of $p(k)-1$ quasirandom properties that a $k$-uniform hypergraph can have. Our work connects previous notions on linear hypergraph quasirandomness by Kohayakawa,
JOHN LENZ, DHRUV MUBAYI
doaj   +1 more source

Central hubs prediction for bio networks by directed hypergraph - GA with validation to COVID-19 PPI. [PDF]

Pattern Recognit Lett, 2022
Gopalakrishnan S, Sridharan S, Nayak SR, Nayak J, Venkataraman S.   +4 more
europepmc   +1 more source

PERSISTENT HYPERDIGRAPH HOMOLOGY AND PERSISTENT HYPERDIGRAPH LAPLACIANS. [PDF]

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

Finite Hypergraph Families with Rich Extremal Turán Constructions via Mixing Patterns

Forum of Mathematics, Sigma
We prove that, for any finite set of minimal r-graph patterns, there is a finite family $\mathcal F$ of forbidden r-graphs such that the extremal Turán constructions for $\mathcal F$ are precisely the maximum r-graphs obtainable from mixing
Xizhi Liu, Oleg Pikhurko
doaj   +1 more source

Extremal, enumerative and probabilistic results on ordered hypergraph matchings

Forum of Mathematics, Sigma
An ordered r-matching is an r-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of r-dimensional orders.
Michael Anastos, Zhihan Jin, Matthew Kwan, Benny Sudakov   +3 more
doaj   +1 more source

Chain and threshold hypergraphs

AKCE International Journal of Graphs and Combinatorics
Threshold graphs and chain graphs are the graphs with maximum spectral radius among the family of all connected graphs and connected bipartite graphs, respectively.
Shashwath S. Shetty, Arathi Bhat K
doaj   +1 more source

Almost and quasi-Leinster groups

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica
In this paper, we extend the parallelism between perfect numbers and Leinster groups, by introducing the new concepts of almost and quasi-Leinster groups which parallel almost and quasi-perfect numbers.
Pleşca Iulia-Cătălina, Tărnăuceanu Marius   +1 more
doaj   +1 more source

Graphs with disjoint dominating and paired-dominating sets

Open Mathematics, 2010
Southey Justin, Henning Michael
doaj   +1 more source

On Edge Exchangeable Random Graphs. [PDF]

J Stat Phys, 2018
Janson S.
europepmc   +1 more source

Hypergraphs with large transversal number and with edge sizes at least four

Open Mathematics, 2012
Henning Michael, Löwenstein Christian
doaj   +1 more source