Results 51 to 60 of about 2,959 (186)
Chromatic Ramsey Numbers and Two‐Color Turán Densities
Journal of Graph Theory, EarlyView.ABSTRACT Given a graph G, its 2‐color Turán number ex ( 2 ) ( n , G ) is the maximum number of edges in an n‐vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of G. Let π ( 2 ) ( G ) = lim n → ∞ ex ( 2 ) ( n , G ) / n 2 be the 2‐color Turán density of G.
Maria Axenovich, Simon Gaa, Dingyuan Liu
wiley +1 more source
Learning fuzzy representations for hypergraph node classification
Scientific ReportsAs an extension of standard graphs, hypergraphs have demonstrated significant advantages in modeling high-order complex relationships compared with standard graphs. Existing literature has witnessed the great success of hypergraph representation learning
Zhishu Sun, Ruijing Geng, Ge Zhang
doaj +1 more source
Sparse Graphs With Local Covering Conditions on Edges
Journal of Graph Theory, EarlyView.ABSTRACT In 1988, Erdős suggested the question of minimizing the number of edges in a connected n $n$‐vertex graph where every edge is contained in a triangle. Shortly after, Catlin, Grossman, Hobbs, and Lai resolved this in a stronger form. In this paper, we study a natural generalization of the question of Erdős in which we replace “triangle” with ...
Debsoumya Chakraborti +3 more
wiley +1 more source
Hyperbolic multi-channel hypergraph convolutional neural network based on multilayer hypergraph
Scientific ReportsIn recent years, hypergraph neural networks have achieved remarkable success in tasks such as node classification, link prediction, and graph classification, thanks to their powerful computational capabilities.
Libing Bai +4 more
doaj +1 more source
Computer Science Journal of Moldova, 1993 We introduce the notion of an anti-edge of a hypergraph, which is a non-overall polychromatic subset of vertices. The maximal number of colors, for which there exists a coloring of a hypergraph using all colors, is called an upper chromatic number of a ...
V. Voloshin
doaj
Saturated Partial Embeddings of Planar Graphs
Journal of Graph Theory, EarlyView.ABSTRACT In this work, we study how far one can deviate from optimal behavior when embedding a planar graph. For a planar graph G $G$, we say that a plane subgraph H ⊆ G $H\subseteq G$ is a plane‐saturated subgraph if adding any edge (possibly with new vertices) to H $H$ would either violate planarity or make the resulting graph no longer a subgraph of
Alexander Clifton, Nika Salia
wiley +1 more source
Combinatorics, Probability and ComputingAbstract For $\ell \geq 3$ , an $\ell$
Lior Gishboliner, Ethan Honest
openaire +2 more sources
Multiview Hypergraph Fusion Network for Change Detection in High-Resolution Remote Sensing Images
IEEE Journal of Selected Topics in Applied Earth Observations and Remote SensingCurrently, convolutional neural networks and transformers have been the dominant paradigms for change detection (CD) thanks to their powerful local and global feature extraction capabilities. However, with the improvement of resolution, spatial, spectral,
Xue Zhao +5 more
doaj +1 more source
Knee Surgery, Sports Traumatology, Arthroscopy, EarlyView.Abstract Purpose To systematically evaluate the performance, methodological quality, and translational barriers of deep learning (DL) models for predicting knee osteoarthritis (KOA) progression from medical imaging. Methods Following PRISMA guidelines, we searched PubMed, Scopus, and Web of Science (inception to June 2026) for peer‐reviewed studies ...
Amna Gillani +5 more
wiley +1 more source
SIAM Journal on Discrete Mathematics, 2008 Generalizing the notion of split graphs to uniform hypergraphs, we prove that the class of these hypergraphs can be characterized by a finite list of excluded induced subhypergraphs. We show that a characterization by generalized degree sequences is impossible, unlike in the well-known case of split graphs. We also give an algorithm to decide whether a
openaire +2 more sources