Results 91 to 100 of about 653 (189)
On the Lovasz O-number of Almost Regular Graphs With Application to Erdos-Renyi Graphs
AMS classifications: 05C69; 90C35; 90C22;Erdos-Renyi graph;stability number;Lovasz O-number;Schrijver O-number;C*-algebra;semidefinite ...
Klerk, E. de +3 more
core
On Regular Hypergraphs of High Girth
, 2016 We give lower bounds on the maximum possible girth of an r-uniform, d-regular hypergraph with at most n vertices, using the definition of a hypergraph cycle due to Berge.
Linial, N, ELLIS, DC
core
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
A variant of the hypergraph removal lemma
, 2006 Recent work of Gowers [T. Gowers, A new proof of Szemerédi's theorem, Geom. Funct. Anal. 11 (2001) 465–588] and Nagle, Rödl, Schacht, and Skokan [B. Nagle, V. Rödl, M.
Tao, Terence
core +1 more source
Hypergraph coverings and Ramanujan Hypergraphs
In this paper we investigate Ramanujan hypergraphs by using hypergraph coverings. We first show that the spectrum of a $k$-fold covering $\bar{H}$ of a connected hypergraph $H$ contains the spectrum of $H$, and that it is the union of the spectrum of $H$
Fan, Yi-Zheng +2 more
core
A selection algorithm based on the hypergraph theory
, 2014 Artykuł porusza kwestię selekcji określonych elementów zbioru z wykorzystaniem teorii hipergrafów. Przedstawiona została idea wspólnego algorytmu selekcji, w przypadku takich problemów, jak selekcja podsieci automatowych w dekompozycji sieci Petriego, a ...
Adamski, M. +2 more
core
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
Algorithmic Applications of Hypergraph and Partition Containers
, 2022 We present a general method to convert algorithms into faster algorithms for almost-regular input instances. Informally, an almost-regular input is an input in which the maximum degree is larger than the average degree by at most a constant factor.
Zamir, Or
core
Multi-task Learning of Heterogeneous Hypergraph Representations in LBSNs
Location-based service networks (LBSNs) have emerged as a primary source for numerous applications that attempt to understand human mobility and analyze social networks.
Nguyen, DDA +5 more
core +1 more source
Hypergraph-Based Interconnection Networks for Large Multicomputers [PDF]
, 1994 This thesis deals with issues pertaining to multicomputer interconnection networks namely topology, technology, switching method, and routing algorithm.
Ould-Khaoua, Mohamed
core