Results 41 to 50 of about 4,061 (147)
Sequentially Constrained Hamilton Cycles in Random Graphs
Random Structures &Algorithms, Volume 67, Issue 1, August 2025.ABSTRACT We discuss the existence of Hamilton cycles in the random graph Gn,p$$ {G}_{n,p} $$ where there are restrictions caused by (i) coloring sequences, (ii) a subset of vertices must occur in a specific order, and (iii) there is a bound on the number of inversions in the associated permutation.
Alan Frieze, Wesley Pegden
wiley +1 more source
Canonical colourings in random graphs
Journal of the London Mathematical Society, Volume 112, Issue 2, August 2025.Abstract Rödl and Ruciński (J. Amer. Math. Soc. 8 (1995), 917–942) established Ramsey's theorem for random graphs. In particular, for fixed integers r$r$, ℓ⩾2$\ell \geqslant 2$ they proved that p̂Kℓ,r(n)=n−2ℓ+1$\hat{p}_{K_\ell,r}(n)=n^{-\frac{2}{\ell +1}}$ is a threshold for the Ramsey property that every r$r$‐colouring of the edges of the binomial ...
Nina Kamčev, Mathias Schacht
wiley +1 more source
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 +1 more
wiley +1 more source
Conflict-Free Coloring Made Stronger
, 2010 In FOCS 2002, Even et al. showed that any set of $n$ discs in the plane can be Conflict-Free colored with a total of at most $O(\log n)$ colors. That is, it can be colored with $O(\log n)$ colors such that for any (covered) point $p$ there is some disc ...
A. Bar-Noy +10 more
core +1 more source
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
Graph Set-colorings And Hypergraphs In Topological Coding [PDF]
, 2022 Bing Yao, Fei Ma
openalex +1 more source
Conflict-Free Coloring of Intersection Graphs of Geometric Objects
, 2017 In FOCS'2002, Even et al. introduced and studied the notion of conflict-free colorings of geometrically defined hypergraphs. They motivated it by frequency assignment problems in cellular networks. This notion has been extensively studied since then. A
Keller, Chaya, Smorodinsky, Shakhar
core +1 more source
Coloured shuffle compatibility, Hadamard products, and ask zeta functions
Bulletin of the London Mathematical Society, Volume 57, Issue 7, Page 2132-2154, July 2025.Abstract We devise an explicit method for computing combinatorial formulae for Hadamard products of certain rational generating functions. The latter arise naturally when studying so‐called ask zeta functions of direct sums of modules of matrices or class‐ and orbit‐counting zeta functions of direct products of nilpotent groups.
Angela Carnevale +2 more
wiley +1 more source
The existence of subspace designs
Proceedings of the London Mathematical Society, Volume 131, Issue 1, July 2025.Abstract We prove the existence of subspace designs with any given parameters, provided that the dimension of the underlying space is sufficiently large in terms of the other parameters of the design and satisfies the obvious necessary divisibility conditions. This settles an open problem from the 1970s.
Peter Keevash +2 more
wiley +1 more source