Results 71 to 80 of about 772 (221)
Crossing estimates for the Ising model on general s‐embeddings
Proceedings of the London Mathematical Society, Volume 131, Issue 4, October 2025.Abstract We prove Russo–Seymour–Welsh‐type crossing estimates for the FK–Ising model on general s‐embeddings whose origami map has an asymptotic Lipschitz constant strictly smaller than 1, provided it satisfies a mild non‐degeneracy assumption. This result extends the work of Chelkak and provides a general framework to prove that the usual connection ...
Rémy Mahfouf
wiley +1 more source
Random multilinear maps and the Erdős box problem
Discrete Analysis, 2021 Random multilinear maps and the Erdős box problem, Discrete Analysis 2021:17, 8 pp. A major theme in extremal combinatorics is determining the maximum number of edges that a graph or hypergraph can have if it does not contain a certain fixed graph or ...
David Conlon +2 more
doaj +1 more source
Weighted Turán Theorems With Applications to Ramsey‐Turán Type of Problems
Journal of Graph Theory, Volume 110, Issue 1, Page 59-71, September 2025.ABSTRACT We study extensions of Turán Theorem in edge‐weighted settings. A particular case of interest is when constraints on the weight of an edge come from the order of the largest clique containing it. These problems are motivated by Ramsey‐Turán type problems.
József Balogh +2 more
wiley +1 more source
The Generic Circular Triangle‐Free Graph
Journal of Graph Theory, Volume 109, Issue 4, Page 426-445, August 2025.ABSTRACT In this article, we introduce the generic circular triangle‐free graph C 3 and propose a finite axiomatization of its first‐order theory. In particular, our main results show that a countable graph G embeds into C 3 if and only if it is a { K 3 , K 1 + 2 K 2 , K 1 + C 5 , C 6 }‐free graph.
Manuel Bodirsky, Santiago Guzmán‐Pro
wiley +1 more source
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
Methods in Ecology and Evolution, Volume 16, Issue 8, Page 1851-1867, August 2025.Abstract Being able to infer the interactions between a set of species from observations of the system is of paramount importance to obtain explanatory and predictive models in ecology. We tackled this challenge by employing qualitative modelling frameworks and logic methods for the synthesis of mathematical models that can integrate both observations ...
Loïc Paulevé, Cédric Gaucherel
wiley +1 more source
Coloring Graphs With Forbidden Almost Bipartite Subgraphs
Random Structures &Algorithms, Volume 66, Issue 4, July 2025.ABSTRACT Alon, Krivelevich, and Sudakov conjectured in 1999 that for every finite graph F$$ F $$, there exists a quantity c(F)$$ c(F) $$ such that χ(G)≤(c(F)+o(1))Δ/logΔ$$ \chi (G)\le \left(c(F)+o(1)\right)\Delta /\mathrm{log}\Delta $$ whenever G$$ G $$ is an F$$ F $$‐free graph of maximum degree Δ$$ \Delta $$. The largest class of connected graphs F$$
James Anderson +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
Complexity Framework for Forbidden Subgraphs
, 2022 For any finite set H={H1,…,Hp} of graphs, a graph is H-subgraph-free if it does not contain any of H1,…,Hp as a subgraph. Similar to known meta-classifications for the minor and topological minor relations, we give a meta-classification for the subgraph relation.
Johnson, Matthew S. +6 more
openaire +2 more sources