English
Related papers

Related papers: Complete Bipartite Partition Relations in Cohen Ex…

200 papers

In this paper we produce models $V_1\subseteq V_2$ of set theory such that adding $\kappa$-many Cohen reals to $V_2$ adds $\lambda$-many Cohen reals to $V_1$, for some $\lambda>\kappa$. We deal mainly with the case when $V_1$ and $V_2$ have…

Logic · Mathematics 2015-03-17 Moti Gitik , Mohammad Golshani

We introduce the idea of a coherent adequate set of models, which can be used as side conditions in forcing. As an application we define a forcing poset which adds a square sequence on $\omega_2$ using finite conditions.

Logic · Mathematics 2014-06-13 John Krueger

We prove that $\chi(G) \leq \max {\omega(G), \Delta_2(G), (5/6)(\Delta(G) + 1)}$ for every graph $G$ with $\Delta(G) \geq 3$. Here $\Delta_2$ is the parameter introduced by Stacho that gives the largest degree that a vertex $v$ can have…

Combinatorics · Mathematics 2011-08-09 Landon Rabern

A forcing poset of size 2^{2^{aleph_1}} which adds no new reals is described and shown to provide a Delta^2_2 definable well-order of the reals (in fact, any given relation of the reals may be so encoded in some generic extension). The…

Logic · Mathematics 2007-05-23 Uri Abraham , Saharon Shelah

We address a question posed by Fessler-Jensen-Kelsey-Owen regarding graphs whose second gonality is greater than the first by exactly 1. We answer the question affirmatively under a stronger condition, thereby characterising the entire…

Combinatorics · Mathematics 2025-11-25 Šimun Dropuljić , Yoav Len

We prove a Riemann-Roch theorem for real divisors on edge-weighted graphs over the reals, extending the result of Baker and Norine for integral divisors on graphs with multiple edges.

Algebraic Geometry · Mathematics 2017-11-13 Rodney James , Rick Miranda

We give a sharp refinement of a result of Alon, Ben-Shimon and Krivelevich. This gives a sufficient condition for a finite sequence of positive integers to be the vertex degree list of both parts of a bipartite graph. The condition depends…

Combinatorics · Mathematics 2014-03-26 Grant Cairns , Stacey Mendan , Yuri Nikolayevsky

We show that $\mathsf{PFA}$ (Proper Forcing Axiom) implies that adding any number of Cohen subsets of $\omega$ will not add an $\omega_2$-Aronszajn tree or a weak $\omega_1$-Kurepa tree, and moreover no $\sigma$-centered forcing can add a…

Logic · Mathematics 2022-08-05 Radek Honzik , Chris Lambie-Hanson , Šárka Stejskalová

We prove the consistency of ``CH + 2^{aleph_1} is arbitrarily large + 2^{aleph_1} not-> (omega_1 x omega)^2_2''. If fact, we can get 2^{aleph_1} not-> [omega_1 x omega]^2_{aleph_0}. In addition to this theorem, we give generalizations to…

Logic · Mathematics 2009-09-25 Saharon Shelah

We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…

Logic · Mathematics 2023-01-02 Daisuke Ikegami , Philipp Schlicht

We prove that \textsf{P}-points (even strong P-points) and Gruff ultrafilters exist in any forcing extension obtained by adding fewer than $\aleph_{\omega}% $-many random reals to a model of \textsf{CH. }These results improve and correct…

Logic · Mathematics 2025-09-18 Alan Dow , Osvaldo Guzmán

Boettcher, Schacht and Taraz gave a condition on the minimum degree of a graph G on n vertices that ensures G contains every r-chromatic graph H on n vertices of bounded degree and of bandwidth o(n), thereby proving a conjecture of Bollobas…

Combinatorics · Mathematics 2012-09-06 Fiachra Knox , Andrew Treglown

We prove that a fractional perfect matching in a non-bipartite graph can be written, in polynomial time, as a convex combination of perfect matchings. This extends the Birkhoff-von Neumann Theorem from bipartite to non-bipartite graphs. The…

Data Structures and Algorithms · Computer Science 2020-10-16 Vijay V. Vazirani

Let $G$ be a regular graph with $m$ edges, and let $\mu_1, \mu_2$ denote the two largest eigenvalues of $A_G$, the adjacency matrix of $G$. We show that, if $G$ is not complete, then $$\mu_1^2 + \mu_2^2 \leq \frac{2(\omega - 1)}{\omega} m$$…

Combinatorics · Mathematics 2024-01-04 Shengtong Zhang

Foreman proved the Duality Theorem, which gives an algebraic characterization of certain ideal quotients in generic extensions. As an application he proved that generic supercompactness of $\omega_1$ is preserved by any proper forcing. We…

Logic · Mathematics 2015-08-04 Brent Cody , Sean Cox

By forcing with $\mathbb{P}_{\rm max}$ over strong models of determinacy, we obtain models where different square principles at $\omega_2$ and $\omega_3$ fail. In particular, we obtain a model of $2^{\aleph_0}=2^{\aleph_1}=\aleph_2 +…

We study pairs of graphs (H_1,H_2) such that every graph with the densities of H_1 and H_2 close to the densities of H_1 and H_2 in a random graph is quasirandom; such pairs (H_1,H_2) are called forcing. Non-bipartite forcing pairs were…

Combinatorics · Mathematics 2019-06-11 Tamas Hubai , Dan Kral , Olaf Parczyk , Yury Person

Assuming the P-ideal dichotomy, we attempt to isolate those cardinal characteristics of the continuum that are correlated with two well-known consequences of the proper forcing axiom. We find a cardinal invariant $\mathfrak{x}$ such that…

Logic · Mathematics 2013-05-27 Dilip Raghavan , Stevo Todorcevic

In this paper we show that if the Stanley-Reisner ring of the simplicial complex of independent sets of a bipartite graph $G$ satisfies Serre's condition $S_2$, then $G$ is Cohen-Macaulay. As a consequence, the characterization of…

Commutative Algebra · Mathematics 2010-01-22 Hassan Haghighi , Siamak Yassemi , Rahim Zaare-Nahandi

We give, using higher Bernstein polynomials defined in our paper [2], a stronger version of our previous result in [1] whose converse is proved in [2] and we give some complements to the results in [2] which help to compute these higher…

Algebraic Geometry · Mathematics 2023-11-23 Daniel Barlet