Results 31 to 40 of about 142 (135)
Color-critical graphs and hypergraphs
Journal of Combinatorial Theory, Series B, 1974 Abstract The main purpose of this paper is to present a technique for obtaining constructions of color-critical graphs. The technique consists in reducing color-critical hypergraphs to color-critical graphs, and the constructions obtained generalize and unify known constructions.
openaire +3 more sources
CF‐SBERTHet: Collaborative and Textual Knowledge Enhanced Semantic Graphs for Sparse Recommendations
Expert Systems, Volume 43, Issue 7, July 2026.ABSTRACT Modern e‐commerce platforms face a critical challenge: delivering accurate recommendations under extreme user–item interaction sparsity, where textual context remains systematically underutilised. Existing collaborative filtering methods degrade sharply in sparse settings, while semantic approaches fail to capture collaborative patterns ...
He Ma +7 more
wiley +1 more source
From points to complexes: A concept of unexpectedness for simplicial complexes
Journal of the London Mathematical Society, Volume 114, Issue 1, July 2026.Abstract In 2018, Cook, Harbourne, Migliore, and Nagel introduced the concept of unexpected hypersurfaces, which connects the study of Lefschetz properties of Artinian algebras defined by powers of linear forms to a family of interpolation problems.
Thiago Holleben
wiley +1 more source
Color-bounded hypergraphs, V: host graphs and subdivisions
Discussiones Mathematicae Graph Theory, 2011 A color-bounded hypergraph is a hypergraph (set system) with ver- tex set X and edge set e = {E1, . . . ,Em}, together with integers si and ti satisfying 1 ≤ si ≤ ti ≤ |E1| for each i = 1, . . . ,m. A vertex coloring φ is proper if for every i, the number of colors occurring in edge 1 satisfies si ≤ |φ(Ei)| ≤ t i.
Csilla Bujtás +2 more
openaire +1 more source
Human Brain Mapping, Volume 47, Issue 8, June 1, 2026.We propose MSSM+, an extension of multiscale structural mapping (MSSM), together with surface supervertex mapping (SSVM) and a Supervertex Vision Transformer (SV‐ViT). Together, these methods exhibited better performance in detecting Alzheimer's disease and less variability across MR vendors than MSSM.
Geonwoo Baek +3 more
wiley +1 more source
Coloring the hypergraph of maximal cliques of a graph with no long path
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sylvain Gravier +2 more
openaire +1 more source
Two‐Round Ramsey Games on Random Graphs
Random Structures &Algorithms, Volume 68, Issue 3, May 2026.ABSTRACT Motivated by the investigation of sharpness of thresholds for Ramsey properties in random graphs, Friedgut, Kohayakawa, Rödl, Ruciński and Tetali introduced two variants of a single‐player game whose goal is to colour the edges of a random graph, in an online fashion, so as not to create a monochromatic triangle.
Yahav Alon +2 more
wiley +1 more source
Erdős‐Rogers Functions for Arbitrary Pairs of Graphs
Random Structures &Algorithms, Volume 68, Issue 3, May 2026.ABSTRACT Let fF,G(n)$$ {f}_{F,G}(n) $$ be the largest size of an induced F$$ F $$‐free subgraph that every n$$ n $$‐vertex G$$ G $$‐free graph is guaranteed to contain. We prove that for any triangle‐free graph F$$ F $$, fF,K3(n)=fK2,K3(n)1+o(1)=n12+o(1).$$ {f}_{F,{K}_3}(n)={f}_{K_2,{K}_3}{(n)}^{1+o(1)}={n}^{\frac{1}{2}+o(1)}. $$Along the way we give a
Dhruv Mubayi, Jacques Verstraëte
wiley +1 more source
The dynamics of criminal collaboration: Multiplex ties in mafia networks
Criminology, Volume 64, Issue 2, Page 284-312, May 2026.Abstract This study examines how social embeddedness and multiplex relationships shape criminal collaboration within organized crime networks. Drawing on data from three major investigations into the ‘Ndrangheta, we analyze how kinship, clan affiliation, leadership, and prior interactions influence participation in meetings and phone calls.
Francesco Calderoni +2 more
wiley +1 more source
Fractional clique decompositions of dense hypergraphs
Bulletin of the London Mathematical Society, Volume 58, Issue 5, May 2026.Abstract In 2014, Keevash famously proved the existence of (n,q,r)$(n,q,r)$‐Steiner systems as part of settling the Existence Conjecture of Combinatorial Designs (dating from the mid‐1800s). In 2020, Glock, Kühn, and Osthus conjectured a minimum degree generalization: specifically that minimum (r−1)$(r-1)$‐degree at least (1−Cqr−1)n$(1-\frac{C}{q^{r-1}}
Michelle Delcourt +2 more
wiley +1 more source