Results 71 to 80 of about 418 (155)
Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.Abstract In 1973, Erdős conjectured the existence of high girth (n,3,2)$(n,3,2)$‐Steiner systems. Recently, Glock, Kühn, Lo, and Osthus and independently Bohman and Warnke proved the approximate version of Erdős' conjecture. Recently, Kwan, Sah, Sawhney, and Simkin proved Erdős' conjecture.
Michelle Delcourt, Luke Postle
wiley +1 more source
Counting in hypergraphs via regularity inheritance [PDF]
Electronic Notes in Discrete Mathematics, 2015 We develop a theory of regularity inheritance in 3-uniform hypergraphs. As a simple consequence we deduce a strengthening of a counting lemma of Frankl and Rodl. We believe that the approach is sufficiently flexible and general to permit extensions of our results in the direction of a hypergraph blow-up lemma.
openaire +1 more source
Regularity inheritance in hypergraphs
, 2019 We give a new approach to handling hypergraph regularity. This approach allows for vertex-by-vertex embedding into regular partitions of hypergraphs, and generalises to regular partitions of sparse hypergraphs. We also prove a corresponding sparse hypergraph regularity lemma.
Allen, Peter +2 more
openaire +2 more sources
Higher-Order Regularization Learning on Hypergraphs
CoRRHigher-Order Hypergraph Learning (HOHL) was recently introduced as a principled alternative to classical hypergraph regularization, enforcing higher-order smoothness via powers of multiscale Laplacians induced by the hypergraph structure. Prior work established the well- and ill-posedness of HOHL through an asymptotic consistency analysis in geometric ...
Adrien Weihs +2 more
openaire +2 more sources
A Simple Regularization of Hypergraphs
, 2006 We give a simple and natural (probabilistic) construction of hypergraph regularization. It is done just by taking a constant-bounded number of random vertex samplings only one time (thus, iteration-free). It is independent from the definition of quasi-randomness and yields a new elementary proof of a strong hypergraph regularity lemma. Consequently, as
openaire +2 more sources
Is It Easy to Regularize a Hypergraph With Easy Links?
International Mathematics Research NoticesAbstract A partition of a (hyper)graph is $\varepsilon $-homogeneous if the edge densities between almost all clusters are either at most $\varepsilon $ or at least $1-\varepsilon $. Suppose a $3$-graph has the property that the link of every vertex has an $\varepsilon $-homogeneous partition of size $\textrm{poly}(1/\varepsilon ...
Gishboliner, Lior +2 more
openaire +2 more sources
Strategy evolution on temporal hypergraphs. [PDF]
Proc Natl Acad Sci U S AWang X, Zhou L, McAvoy A, Tian Z, Li A.
europepmc +1 more source
Traffic flow prediction via dynamic hypergraph learning. [PDF]
PLoS OneWei S, Yang Y, Wang C.
europepmc +1 more source
Spherical fuzzy hypergraph in decision making. [PDF]
Sci RepPramanik T +5 more
europepmc +1 more source