Results 71 to 80 of about 24,599 (177)
P 4-Colorings and P 4-Bipartite Graphs
Discrete Mathematics & Theoretical Computer Science, 2001 A vertex partition of a graph into disjoint subsets V i s is said to be a P 4-free coloring if each color class V i induces a subgraph without chordless path on four vertices (denoted by P 4).
Chính T. Hoàng, Van Bang Le
doaj
Unavoidable Induced Subgraphs in Graphs with Complete Bipartite Induced Minors
SIAM Journal on Discrete Mathematics26 pages, 14 figures.
Maria Chudnovsky +4 more
openaire +2 more sources
Dimer models and conformal structures
Communications on Pure and Applied Mathematics, Volume 79, Issue 2, Page 340-446, February 2026.Abstract Dimer models have been the focus of intense research efforts over the last years. Our paper grew out of an effort to develop new methods to study minimizers or the asymptotic height functions of general dimer models and the geometry of their frozen boundaries.
Kari Astala +3 more
wiley +1 more source
Lower Bounds for Ramsey Numbers for Complete Bipartite and 3-Uniform Tripartite Subgraphs
Journal of Graph Algorithms and Applications, 2013 Summary: Let \(R(K_{a,b},K_{c,d})\) be the minimum number \(n\) so that any \(n\)-vertex simple undirected graph \(G\) contains a \(K_{a,b}\) or its complement \(G'\) contains a \(K_{c,d}\). We demonstrate constructions showing that \(R(K_{2,b},K_{2,d}) > b+d+1\) for \(d \geq b \geq 2\). We establish lower bounds for \(R(K_{a,b},K_{a,b})\) and \(R(K_{a,
Kuamr Mishra, Tapas +1 more
openaire +2 more sources
A tropical approach to rigidity: Counting realisations of frameworks
Journal of the London Mathematical Society, Volume 113, Issue 2, February 2026.Abstract A realisation of a graph in the plane as a bar‐joint framework is rigid if there are finitely many other realisations, up to isometries, with the same edge lengths. Each of these finitely many realisations can be seen as a solution to a system of quadratic equations prescribing the distances between pairs of points.
Oliver Clarke +6 more
wiley +1 more source
Kneser graphs are like Swiss cheese
Discrete Analysis, 2018 Kneser graphs are like Swiss cheese, Discrete Analysis 2018:2, 18 pp. This paper relates two very interesting areas of research in extremal combinatorics: removal lemmas, and influence of variables.
Ehud Friedgut, Oded Regev
doaj +1 more source
Nearly Hamilton cycles in sublinear expanders and applications
Journal of the London Mathematical Society, Volume 113, Issue 2, February 2026.Abstract We develop novel methods for constructing nearly Hamilton cycles in sublinear expanders with good regularity properties, as well as new techniques for finding such expanders in general graphs. These methods are of independent interest due to their potential for various applications to embedding problems in sparse graphs.
Shoham Letzter +2 more
wiley +1 more source
Zero‐free regions for the independence polynomial on restricted graph classes
Journal of the London Mathematical Society, Volume 113, Issue 2, February 2026.Abstract Generalising the Heilmann–Lieb theorem from statistical physics, Chudnovsky and Seymour [J. Combin. Theory Ser. B, 97 (2007), no. 3, 350–357] showed that the univariate independence polynomial of any claw‐free graph has all of its zeros on the negative real line. In this paper, we show that for any fixed subdivided claw H$H$ and any Δ$\Delta$,
Mark Jerrum, Viresh Patel
wiley +1 more source
On Sampling Colorings of Bipartite Graphs
Discrete Mathematics & Theoretical Computer Science, 2006 We study the problem of efficiently sampling k-colorings of bipartite graphs. We show that a class of markov chains cannot be used as efficient samplers.
R. Balasubramanian, C. R. Subramanian
doaj
A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components
Discrete Mathematics, 1986 The complete bipartite graph \(k_{1,m}\), \(m\geq 1\), is called a star. In this note it is shown, for \(n\geq 4\), that the minimum number of star- subgraphs which partition the edges of \(k_{2n-1,2n-1}\) or \(k_{2n,2n}\) is \(n+2\).
Egawa, Yoshimi +3 more
openaire +2 more sources