Results 91 to 100 of about 9,740 (155)
Hypergraphs with arbitrarily small codegree Turán density
Bulletin of the London Mathematical Society, Volume 58, Issue 4, April 2026.Abstract The codegree Turán density γ(F)$\gamma (F)$ of a k$k$‐graph F$F$ is the smallest γ∈[0,1)$\gamma \in [0,1)$ such that every k$k$‐graph H$H$ with δk−1(H)⩾(γ+o(1))|V(H)|$\delta _{k-1}(H)\geqslant (\gamma +o(1))\vert V(H)\vert$ contains a copy of F$F$. In this work, we show that for every ε>0$\varepsilon >0$, there is a k$k$‐uniform hypergraph F$F$
Simón Piga, Bjarne Schülke
wiley +1 more source
Forbidden subgraphs and the König–Egerváry property
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Flavia Bonomo +5 more
openaire +7 more sources
Toric ideals of matching polytopes and edge colorings
Mathematika, Volume 72, Issue 2, April 2026.Abstract In this paper, we investigate the maximal degree of minimal generators of the toric ideal of the matching polytope of a graph. It is known that the toric ideal associated with a bipartite graph is generated by binomials of degree at most 3.
Kenta Mori +3 more
wiley +1 more source
Local certification of forbidden subgraphs
CoRRDetecting specific structures in a network has been a very active theme of research in distributed computing for at least a decade. In this paper, we start the study of subgraph detection from the perspective of local certification. Remember that a local certification is a distributed mechanism enabling the nodes of a network to check the correctness ...
Nicolas Bousquet 0001 +4 more
openaire +2 more sources
Random Structures &Algorithms, Volume 68, Issue 2, March 2026.ABSTRACT We study the contact process on the long‐range percolation cluster on ℤ$$ \mathbb{Z} $$ where each edge ⟨i,j⟩$$ \left\langle i,j\right\rangle $$ is open with probability |i−j|−s$$ {\left|i-j\right|}^{-s} $$ for s>2$$ s>2 $$. Using a renormalization procedure, we apply the Peierls‐type argument to prove that the contact process dies out if the ...
Pablo A. Gomes +3 more
wiley +1 more source
Forbidden family of Ph-magic graphs
Electronic Journal of Graph Theory and ApplicationsLet G be a simple, finite, and undirected graph and H be a subgraph of G. The graph G admits an H-covering if every edge in G belongs to a subgraph isomorphic to H.
Tita Khalis Maryati +2 more
doaj +1 more source
Diophantine tuples and product sets in shifted powers
Journal of the London Mathematical Society, Volume 113, Issue 3, March 2026.Abstract Let k⩾2$k\geqslant 2$ and n≠0$n\ne 0$. A Diophantine tuple with property Dk(n)$D_k(n)$ is a set of positive integers A$A$ such that ab+n$ab+n$ is a k$k$th power for all a,b∈A$a,b\in A$ with a≠b$a\ne b$. Such generalizations of classical Diophantine tuples have been studied extensively.
Ernie Croot, Chi Hoi Yip
wiley +1 more source
Coloring and density theorems for configurations of a given volume
Proceedings of the London Mathematical Society, Volume 132, Issue 3, March 2026.Abstract This is a treatise on finite point configurations spanning a fixed volume to be found in a single color‐class of an arbitrary finite (measurable) coloring of the Euclidean space Rn$\mathbb {R}^n$, or in a single large measurable subset A⊆Rn$A\subseteq \mathbb {R}^n$.
Vjekoslav Kovač
wiley +1 more source
On Multilevel Energy‐Based Fragmentation Methods
International Journal of Quantum Chemistry, Volume 126, Issue 3, February 5, 2026.We investigate the working equations of energy‐based fragmentation methods and present ML‐SUPANOVA, a Möbius‐inversion‐based multilevel fragmentation scheme that enables adaptive, quasi‐optimal truncations to efficiently approximate Born‐Oppenheimer potentials across hierarchies of electronic‐structure methods and basis sets.
James Barker +2 more
wiley +1 more source
Forbidden Subgraphs for Hamiltonicity of 1-Tough Graphs
Discussiones Mathematicae Graph Theory, 2016 A graph G is said to be 1-tough if for every vertex cut S of G, the number of components of G − S does not exceed |S|. Being 1-tough is an obvious necessary condition for a graph to be hamiltonian, but it is not sufficient in general.
Li Binlong +2 more
doaj +1 more source