Results 101 to 110 of about 1,354,678 (274)

Turán Problems on Non-Uniform Hypergraphs [PDF]

The Electronic Journal of Combinatorics, 2014
A non-uniform hypergraph $H=(V,E)$ consists of a vertex set $V$ and an edge set $E\subseteq 2^V$; the edges in $E$ are not required to all have the same cardinality. The set of all cardinalities of edges in $H$ is denoted by $R(H)$, the set of edge types.
Linyuan Lu, Travis Johnston
openaire   +3 more sources

On the Replica Symmetric Solution in General Diluted Spin Glasses

Random Structures &Algorithms, Volume 66, Issue 4, July 2025.
ABSTRACT We present a unifying approach to studying the replica symmetric solution in general diluted spin glass models on random p$$ p $$‐uniform hypergraphs with sparsity parameter α$$ \alpha $$. Our result shows that there exist two key regimes in which the model exhibits replica symmetry and the free energy can be explicitly represented as the ...
Ratul Biswas, Wei‐Kuo Chen, Arnab Sen
wiley   +1 more source

Recognizing the P_4-structure of claw-free graphs and a larger graph class [PDF]

Discrete Mathematics & Theoretical Computer Science, 2002
The P_4-structure of a graph G is a hypergraph \textbfH on the same vertex set such that four vertices form a hyperedge in \textbfH whenever they induce a P_4 in G.
Luitpold Babel, Andreas Brandstädt, Van Bang Le   +2 more
doaj   +1 more source

Optimal Zero‐Free Regions for the Independence Polynomial of Bounded Degree Hypergraphs

Random Structures &Algorithms, Volume 66, Issue 4, July 2025.
ABSTRACT In this paper, we investigate the distribution of zeros of the independence polynomial of hypergraphs of maximum degree Δ$$ \Delta $$. For graphs, the largest zero‐free disk around zero was described by Shearer as having radius λs(Δ)=(Δ−1)Δ−1/ΔΔ$$ {\lambda}_s\left(\Delta \right)={\left(\Delta -1\right)}^{\Delta -1}/{\Delta}^{\Delta ...
Ferenc Bencs, Pjotr Buys
wiley   +1 more source

Embedding Factorizations for 3-Uniform Hypergraphs [PDF]

Journal of Graph Theory, 2012
In this paper, two results are obtained on a hypergraph embedding problem. The proof technique is itself of interest, being the first time amalgamations have been used to address the embedding of hypergraphs. The first result finds necessary and sufficient conditions for the embedding a hyperedge-colored copy of the complete 3-uniform hypergraph of ...
Christopher A. Rodger, Amin Bahmanian
openaire   +3 more sources

Sparse graph signals – uncertainty principles and recovery

GAMM-Mitteilungen, Volume 48, Issue 2, June 2025.
ABSTRACT We study signals that are sparse either on the vertices of a graph or in the graph spectral domain. Recent results on the algebraic properties of random integer matrices as well as on the boundedness of eigenvectors of random matrices imply two types of support size uncertainty principles for graph signals.
Tarek Emmrich, Martina Juhnke, Stefan Kunis   +2 more
wiley   +1 more source

Recent Advancements in Neuroimaging‐Based Alzheimer's Disease Prediction Using Deep Learning Approaches in e‐Health: A Systematic Review

Health Science Reports, Volume 8, Issue 5, May 2025.
ABSTRACT Purpose Alzheimer's disease (AD) is a severe neurological disease that significantly impairs brain function. Timely identification of AD is essential for appropriate treatment and care. This comprehensive review intends to examine current developments in deep learning (DL) approaches with neuroimaging for AD diagnosis, where popular imaging ...
Zia‐Ur‐Rehman, Mohd Khalid Awang, Ghulam Ali, Muhammad Faheem   +3 more
wiley   +1 more source

Equitable Orientations of Sparse Uniform Hypergraphs

The Electronic Journal of Combinatorics, 2016
Caro, West, and Yuster (2011) studied how $r$-uniform hypergraphs can be oriented in such a way that (generalizations of) indegree and outdegree are as close to each other as can be hoped. They conjectured an existence result of such orientations for sparse hypergraphs, of which we present a proof.
Cohen, Nathann, Lochet, William
openaire   +4 more sources

Partitioning 3-uniform hypergraphs

Journal of Combinatorial Theory, Series B, 2012
Bollobas and Thomason conjectured that the vertices of any r-uniform hypergraph with m edges can be partitioned into r sets so that each set meets at least rm/(2r-1) edges. For r=3, Bollobas, Reed and Thomason proved the lower bound (1-1/e)m/3~0.21m, which was improved to (5/9)m by Bollobas and Scott and to 0.6m by Haslegrave.
Jie Ma, Xingxing Yu
openaire   +2 more sources