Results 101 to 110 of about 56,011 (266)
Properties of Bipolar Fuzzy Hypergraphs [PDF]
, 2013 In this article, we apply the concept of bipolar fuzzy sets to hypergraphs and investigate some properties of bipolar fuzzy hypergraphs. We introduce the notion of $A-$ tempered bipolar fuzzy hypergraphs and present some of their properties.
Akram, M., Dudek, W. A., Sarwar, S.
core
Configuration Models of Random Hypergraphs and their Applications [PDF]
J. Complex Networks, 2019 Many empirical networks are intrinsically polyadic, with interactions occurring within groups of agents of arbitrary size. There are, however, few flexible null models that can support statistical inference in polyadic networks. We define a class of null
Philip S. Chodrow
semanticscholar +1 more source
International Mathematics Research NoticesAbstract We showthat for every integer $k\geqslant 3$ the set of Turán densities of $k$-uniform hypergraphs has an accumulation point in $[0,1)$. In particular, $1/2$ is an accumulation point for the set of Turán densities of $3$-uniform hypergraphs.
Conlon, David, Schülke, Bjarne
openaire +2 more sources
Transactions on Emerging Telecommunications Technologies, Volume 37, Issue 1, January 2026.IntelliMetro‐Hybrid is an intelligent fusion framework that integrates machine learning (ML) and deep learning (DL) for real‐time anomaly detection and economic optimization in smart metro systems. The model combines tree‐based feature extraction (Random Forest, XG Boost) with a deep neural classifier to effectively handle imbalanced, heterogeneous ...
Sijin Peng +6 more
wiley +1 more source
Hypergraph Acyclicity and Propositional Model Counting
, 2014 We show that the propositional model counting problem #SAT for CNF- formulas with hypergraphs that allow a disjoint branches decomposition can be solved in polynomial time.
A. Brandstädt +8 more
core +1 more source
Steiner Triple Systems With High Discrepancy
Journal of Combinatorial Designs, Volume 34, Issue 1, Page 5-14, January 2026.ABSTRACT In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed r ≥ 3 and n ≡ 1 , 3 ( mod 6 ), any r‐colouring of the triples on [ n ] admits a Steiner triple system of order n with discrepancy Ω ( n 2 ).
Lior Gishboliner +2 more
wiley +1 more source
The Electronic Journal of Linear Algebra, 2020 In this paper, energies associated with hypergraphs are studied. More precisely, results are obtained for the incidence and the singless Laplacian energies of uniform hypergraphs. In particular, bounds for the incidence energy are obtained as functions of well known parameters, such as maximum degree, Zagreb index and spectral radius.
Kauê Cardoso, Vilmar Trevisan
openaire +4 more sources
A Refined Graph Container Lemma and Applications to the Hard‐Core Model on Bipartite Expanders
Random Structures &Algorithms, Volume 68, Issue 1, January 2026.ABSTRACT We establish a refined version of a graph container lemma due to Galvin and discuss several applications related to the hard‐core model on bipartite expander graphs. Given a graph G$$ G $$ and λ>0$$ \lambda >0 $$, the hard‐core model on G$$ G $$ at activity λ$$ \lambda $$ is the probability distribution μG,λ$$ {\mu}_{G,\lambda } $$ on ...
Matthew Jenssen +2 more
wiley +1 more source
Journal of the London Mathematical Society, Volume 113, Issue 1, January 2026.Abstract In 1935, Philip Hall published what is often referred to as ‘Hall's marriage theorem’ in a short paper (P. Hall, J. Lond. Math. Soc. (1) 10 (1935), no. 1, 26–30.) This paper has been very influential. I state the theorem and outline Hall's proof, together with some equivalent (or stronger) earlier results, and proceed to discuss some the many ...
Peter J. Cameron
wiley +1 more source