Results 41 to 50 of about 81 (80)
SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS
Forum of Mathematics, Sigma, 2017 A celebrated result of Rödl and Ruciński states that for every graph $F$ , which is not a forest of stars and paths of length 3, and fixed number of colours
LUCA GUGELMANN +5 more
doaj +1 more source
Shortest paths on polymatroids and hypergraphic polytopes [PDF]
Base polytopes of polymatroids, also known as generalized permutohedra, are polytopes whose edges are parallel to a vector of the form \(\mathbf{e}_i - \mathbf{e}_j\), where the \(\{\mathbf{e}_i\}_{i\in [n]}\) are the canonical basis vectors of \(\mathbb{
Cardinal, Jean, Steiner, Raphael
core +1 more source
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
Matching criticality in intersecting hypergraphs [PDF]
, 2017 The transversal number τ(H) of a hypergraph H is the minimum cardinality of a set of vertices that intersects all edges of H. The matching number α′(H) of H is the maximum cardinality of a matching in H. A hypergraph H is intersecting if and only if α′(H)
Ni, Zhenyu, Shan, Erfang, Kang, Liying
core
PERSISTENT HYPERDIGRAPH HOMOLOGY AND PERSISTENT HYPERDIGRAPH LAPLACIANS. [PDF]
Found Data Sci, 2023 Chen D, Liu J, Wu J, Wei GW.
europepmc +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 +4 more
europepmc +1 more source
Random matchings in linear hypergraphs
Forum of Mathematics, SigmaFor a given hypergraph H and a vertex v∈V(H) $v\in V(H)$ v element of upper V left parenthesis upper H right parenthesis , consider a random matching M chosen uniformly from the set of all matchings in H. $H.$ upper H period In 1995, $1995,$
Hyunwoo Lee
doaj +1 more source
Representing Higher-Order Networks: A Survey of Graph-Based Frameworks [PDF]
Many real-world phenomena are naturally modeled by graphs and networks. However, classical graph models are often limited to pairwise interactions and may not adequately capture the richer structures that arise in practice.
Fujita, T., Smarandache, Florentin
core
Finite Hypergraph Families with Rich Extremal Turán Constructions via Mixing Patterns
Forum of Mathematics, SigmaWe 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, SigmaAn 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 +3 more
doaj +1 more source