Results 121 to 130 of about 56,309 (276)

A Sharper Ramsey Theorem for Constrained Drawings

Journal of Graph Theory, Volume 109, Issue 4, Page 401-411, August 2025.
ABSTRACT Given a graph G and a collection C of subsets of R d indexed by the subsets of vertices of G, a constrained drawing of G is a drawing where each edge is drawn inside some set from C, in such a way that nonadjacent edges are drawn in sets with disjoint indices. In this paper we prove a Ramsey‐type result for such drawings.
Pavel Paták
wiley   +1 more source

Weak hypergraph regularity and linear hypergraphs

Journal of Combinatorial Theory, Series B, 2010
AbstractWe consider conditions which allow the embedding of linear hypergraphs of fixed size. In particular, we prove that any k-uniform hypergraph H of positive uniform density contains all linear k-uniform hypergraphs of a given size. More precisely, we show that for all integers ℓ⩾k⩾2 and every d>0 there exists ϱ>0 for which the following holds: if ...
Vojtěch Rödl, Brendan Nagle, Yoshiharu Kohayakawa, Mathias Schacht   +3 more
openaire   +2 more sources

Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem

Journal of Graph Theory, Volume 109, Issue 4, Page 466-480, August 2025.
ABSTRACT Given a hypergraph ℋ, the dual hypergraph of ℋ is the hypergraph of all minimal transversals of ℋ. The dual hypergraph is always Sperner, that is, no hyperedge contains another. A special case of Sperner hypergraphs are the conformal Sperner hypergraphs, which correspond to the families of maximal cliques of graphs.
Endre Boros, Vladimir Gurvich, Martin Milanič, Yushi Uno   +3 more
wiley   +1 more source

On Frankl and Furedi's conjecture for 3-uniform hypergraphs [PDF]

, 2014
The Lagrangian of a hypergraph has been a useful tool in hypergraph extremal problems. In most applications, we need an upper bound for the Lagrangian of a hypergraph. Frankl and Furedi in \cite{FF} conjectured that the $r$-graph with $m$ edges formed by
Peng, Hao, Peng, Yuejian, Tang, Qingsong, Wang, Cailing   +3 more
core  

Dynamic Hypergraph Neural Networks

International Joint Conference on Artificial Intelligence, 2019
In recent years, graph/hypergraph-based deep learning methods have attracted much attention from researchers. These deep learning methods take graph/hypergraph structure as prior knowledge in the model.
Jianwen Jiang, Yuxuan Wei, Yifan Feng, Jingxuan Cao, Yue Gao   +4 more
semanticscholar   +1 more source

Hybrid Support Vector Machine‐Convolutional Neural Networks Multi‐Classification Models for Detection of Kidney Stones

International Journal of Imaging Systems and Technology, Volume 35, Issue 4, July 2025.
ABSTRACT The accurate and early detection of kidney stones is crucial for effective treatment and patient management. This study presents a hybrid machine learning approach combining Support Vector Machines (SVM) and Convolutional Neural Networks (CNN) for the multi‐classification of kidney stones.
Setlhabi Letlhogonolo Rapelang, Ibidun Christiana Obagbuwa   +1 more
wiley   +1 more source

Interval hypergraphs and D-interval hypergraphs

Discrete Mathematics, 1977
AbstractA hypergraph H = (V, E) is called an interval hypergraph if there exists a one-to-one function ƒ mapping the elements of V to points on the real line such that for each edge E, there is an interval I, containing the images of all elements of E, but not the images of any elements not in E1.
openaire   +1 more source

On intersecting hypergraphs

Discrete Mathematics, 1998
AbstractWe investigate the following question: ‘Given an intersecting multi-hypergraph on n points, what fraction of edges must be covered by any of the best 2 points?’ (Here ‘best’ means that together they cover the most.) We call this M2(n). This is a special case of a question asked by Erdös and Gyárfás (1990) (they considered r-wise intersecting ...
Barry Guiduli, Zoltán Király
openaire   +2 more sources

Demonstration of hypergraph-state quantum information processing

Nature Communications
Complex entangled states are the key resources for measurement-based quantum computations, which is realised by performing a sequence of measurements on initially entangled qubits.
Jieshan Huang, Xudong Li, Xiaojiong Chen, Chonghao Zhai, Yun Zheng, Yulin Chi, Yan Li, Qiongyi He, Qihuang Gong, Jianwei Wang   +9 more
doaj   +1 more source

Eigenvalue Approach to Dense Clusters in Hypergraphs

Journal of Graph Theory, Volume 109, Issue 3, Page 353-365, July 2025.
ABSTRACT In this article, we investigate the problem of finding in a given weighted hypergraph a subhypergraph with the maximum possible density. Using the notion of a support matrix we prove that the density of an optimal subhypergraph is equal to ∥ A T A ∥ for an optimal support matrix A. Alternatively, the maximum density of a subhypergraph is equal
Yuly Billig
wiley   +1 more source