منابع مشابه
Bounded Martin's Maximum with an Asterisk
1The first author was supported by Austrian Science Fund (FWF) project M 1408-N25. 2The second author is indebted to W. Hugh Woodin, Ilijas Farah, and Menachem Magidor for crucial conversations on the topics of this paper. He is also grateful to Andrés Caicedo and Paul Larson for many conversations on the topics of this paper in particular during the SQuaRE meetings at the AIM in Palo Alto, May...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملk-forested choosability of graphs with bounded maximum average degree
a proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. a graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $g$ such that each vertex receives a color from its own list. in this paper, we prov...
متن کاملBounded Martin’s Maximum with Many Witnesses
We study a strengthening of Bounded Martin’s Maximum which asserts that if a Σ1 fact holds of ω V 2 in a stationary set preserving extension then it holds in V for a stationary set of ordinals less than ω2. We show that this principle implies Global Projective Determinacy, and therefore does not hold in the Pmax model for BMM, but that the restriction of this principle to forcings which render ...
متن کاملSpanning Trees with Bounded Maximum Degrees of Graphs on Surfaces
For a spanning tree T of a graph G, we define the total excess te(T, k) of T from k as te(T, k) := ∑ v∈V (T )max{dT (v)− k, 0}, where dT (v) is the degree of a vertex v in T . In this paper, we show the following; if G is a 3-connected graph on a surface with Euler characteristic χ < 0, then G has a spanning ⌈8−2χ 3 ⌉ -tree T with te(T, 3) ≤ −2χ − 1. We also show an application of this theorem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2014
ISSN: 0029-4527
DOI: 10.1215/00294527-2688051