- Award ID(s):
- 1700157
- NSF-PAR ID:
- 10087346
- Date Published:
- Journal Name:
- Transactions of the American Mathematical Society. Series B
- Volume:
- 5
- ISSN:
- 2330-0000
- Page Range / eLocation ID:
- 167-221
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
Abstract Recently, Dvořák, Norin, and Postle introduced flexibility as an extension of list coloring on graphs (J Graph Theory 92(3):191–206, 2019, https://doi.org/10.1002/jgt.22447 ). In this new setting, each vertex v in some subset of V ( G ) has a request for a certain color r ( v ) in its list of colors L ( v ). The goal is to find an L coloring satisfying many, but not necessarily all, of the requests. The main studied question is whether there exists a universal constant $$\varepsilon >0$$ ε > 0 such that any graph G in some graph class $$\mathscr {C}$$ C satisfies at least $$\varepsilon$$ ε proportion of the requests. More formally, for $$k > 0$$ k > 0 the goal is to prove that for any graph $$G \in \mathscr {C}$$ G ∈ C on vertex set V , with any list assignment L of size k for each vertex, and for every $$R \subseteq V$$ R ⊆ V and a request vector $$(r(v): v\in R, ~r(v) \in L(v))$$ ( r ( v ) : v ∈ R , r ( v ) ∈ L ( v ) ) , there exists an L -coloring of G satisfying at least $$\varepsilon |R|$$ ε | R | requests. If this is true, then $$\mathscr {C}$$ C is called $$\varepsilon$$ ε - flexible for lists of size k . Choi, Clemen, Ferrara, Horn, Ma, and Masařík (Discrete Appl Math 306:20–132, 2022, https://doi.org/10.1016/j.dam.2021.09.021 ) introduced the notion of weak flexibility , where $$R = V$$ R = V . We further develop this direction by introducing a tool to handle weak flexibility. We demonstrate this new tool by showing that for every positive integer b there exists $$\varepsilon (b)>0$$ ε ( b ) > 0 so that the class of planar graphs without $$K_4, C_5 , C_6 , C_7, B_b$$ K 4 , C 5 , C 6 , C 7 , B b is weakly $$\varepsilon (b)$$ ε ( b ) -flexible for lists of size 4 (here $$K_n$$ K n , $$C_n$$ C n and $$B_n$$ B n are the complete graph, a cycle, and a book on n vertices, respectively). We also show that the class of planar graphs without $$K_4, C_5 , C_6 , C_7, B_5$$ K 4 , C 5 , C 6 , C 7 , B 5 is $$\varepsilon$$ ε -flexible for lists of size 4. The results are tight as these graph classes are not even 3-colorable.more » « less
-
Let $x,y\in (0,1]$, and let $A,B,C$ be disjoint nonempty stable subsets of a graph $G$, where every vertex in $A$ has at least $x|B|$ neighbours in $B$, and every vertex in $B$ has at least $y|C|$ neighbours in $C$, and there are no edges between $A,C$. We denote by $\phi(x,y)$ the maximum $z$ such that, in all such graphs $G$, there is a vertex $v\in C$ that is joined to at least $z|A|$ vertices in $A$ by two-edge paths. This function has some interesting properties: we show, for instance, that $\phi(x,y)=\phi(y,x)$ for all $x,y$, and there is a discontinuity in $\phi(x,x)$ when $1/x$ is an integer. For $z=1/2, 2/3,1/3,3/4,2/5,3/5$, we try to find the (complicated) boundary between the set of pairs $(x,y)$ with $\phi(x,y)\ge z$ and the pairs with $\phi(x,y)more » « less
1/3$. -
A _theta_ is a graph consisting of two non-adjacent vertices and three internally disjoint paths between them, each of length at least two. For a family $\mathcal{H}$ of graphs, we say a graph $G$ is $\mathcal{H}$-_free_ if no induced subgraph of $G$ is isomorphic to a member of $\mathcal{H}$. We prove a conjecture of Sintiari and Trotignon, that there exists an absolute constant $c$ for which every (theta, triangle)-free graph $G$ has treewidth at most $c\log (|V(G)|)$. A construction by Sintiari and Trotignon shows that this bound is asymptotically best possible, and (theta, triangle)-free graphs comprise the first known hereditary class of graphs with arbitrarily large yet logarithmic treewidth.Our main result is in fact a generalization of the above conjecture, that treewidth is at most logarithmic in $|V(G)|$ for every graph $G$ excluding the so-called _three-path-configurations_ as well as a fixed complete graph. It follows that several NP-hard problems such as Stable Set, Vertex Cover, Dominating Set and $k$-Coloring (for fixed $k$) admit polynomial time algorithms in graphs excluding the three-path-configurations and a fixed complete graph.more » « less
-
For a graph F, a graph G is F-free if it does not contain an induced subgraph isomorphic to F. For two graphs G and H, an H-coloring of G is a mapping f : V (G) → V (H) such that for every edge uv ∈ E(G) it holds that f(u)f(v) ∈ E(H). We are interested in the complexity of the problem H-Coloring, which asks for the existence of an H-coloring of an input graph G. In particular, we consider H-Coloring of F-free graphs, where F is a fixed graph and H is an odd cycle of length at least 5. This problem is closely related to the well known open problem of determining the complexity of 3-Coloring of Pt-free graphs. We show that for every odd k ≥ 5 the Ck-Coloring problem, even in the precoloring-extension variant, can be solved in polynomial time in P9-free graphs. On the other hand, we prove that the extension version of Ck-Coloring is NP-complete for F-free graphs whenever some component of F is not a subgraph of a subdivided claw.more » « less
-
Abstract This paper will study almost everywhere behaviors of functions on partition spaces of cardinals possessing suitable partition properties. Almost everywhere continuity and monotonicity properties for functions on partition spaces will be established. These results will be applied to distinguish the cardinality of certain subsets of the power set of partition cardinals.
The following summarizes the main results proved under suitable partition hypotheses.
If
is a cardinal,$\kappa $ ,$\epsilon < \kappa $ ,${\mathrm {cof}}(\epsilon ) = \omega $ and$\kappa \rightarrow _* (\kappa )^{\epsilon \cdot \epsilon }_2$ , then$\Phi : [\kappa ]^\epsilon _* \rightarrow \mathrm {ON}$ satisfies the almost everywhere short length continuity property: There is a club$\Phi $ and a$C \subseteq \kappa $ so that for all$\delta < \epsilon $ , if$f,g \in [C]^\epsilon _*$ and$f \upharpoonright \delta = g \upharpoonright \delta $ , then$\sup (f) = \sup (g)$ .$\Phi (f) = \Phi (g)$ If
is a cardinal,$\kappa $ is countable,$\epsilon $ holds and$\kappa \rightarrow _* (\kappa )^{\epsilon \cdot \epsilon }_2$ , then$\Phi : [\kappa ]^\epsilon _* \rightarrow \mathrm {ON}$ satisfies the strong almost everywhere short length continuity property: There is a club$\Phi $ and finitely many ordinals$C \subseteq \kappa $ so that for all$\delta _0, ..., \delta _k \leq \epsilon $ , if for all$f,g \in [C]^\epsilon _*$ ,$0 \leq i \leq k$ , then$\sup (f \upharpoonright \delta _i) = \sup (g \upharpoonright \delta _i)$ .$\Phi (f) = \Phi (g)$ If
satisfies$\kappa $ ,$\kappa \rightarrow _* (\kappa )^\kappa _2$ and$\epsilon \leq \kappa $ , then$\Phi : [\kappa ]^\epsilon _* \rightarrow \mathrm {ON}$ satisfies the almost everywhere monotonicity property: There is a club$\Phi $ so that for all$C \subseteq \kappa $ , if for all$f,g \in [C]^\epsilon _*$ ,$\alpha < \epsilon $ , then$f(\alpha ) \leq g(\alpha )$ .$\Phi (f) \leq \Phi (g)$ Suppose dependent choice (
),$\mathsf {DC}$ and the almost everywhere short length club uniformization principle for${\omega _1} \rightarrow _* ({\omega _1})^{\omega _1}_2$ hold. Then every function${\omega _1}$ satisfies a finite continuity property with respect to closure points: Let$\Phi : [{\omega _1}]^{\omega _1}_* \rightarrow {\omega _1}$ be the club of$\mathfrak {C}_f$ so that$\alpha < {\omega _1}$ . There is a club$\sup (f \upharpoonright \alpha ) = \alpha $ and finitely many functions$C \subseteq {\omega _1}$ so that for all$\Upsilon _0, ..., \Upsilon _{n - 1} : [C]^{\omega _1}_* \rightarrow {\omega _1}$ , for all$f \in [C]^{\omega _1}_*$ , if$g \in [C]^{\omega _1}_*$ and for all$\mathfrak {C}_g = \mathfrak {C}_f$ ,$i < n$ , then$\sup (g \upharpoonright \Upsilon _i(f)) = \sup (f \upharpoonright \Upsilon _i(f))$ .$\Phi (g) = \Phi (f)$ Suppose
satisfies$\kappa $ for all$\kappa \rightarrow _* (\kappa )^\epsilon _2$ . For all$\epsilon < \kappa $ ,$\chi < \kappa $ does not inject into$[\kappa ]^{<\kappa }$ , the class of${}^\chi \mathrm {ON}$ -length sequences of ordinals, and therefore,$\chi $ . As a consequence, under the axiom of determinacy$|[\kappa ]^\chi | < |[\kappa ]^{<\kappa }|$ , these two cardinality results hold when$(\mathsf {AD})$ is one of the following weak or strong partition cardinals of determinacy:$\kappa $ ,${\omega _1}$ ,$\omega _2$ (for all$\boldsymbol {\delta }_n^1$ ) and$1 \leq n < \omega $ (assuming in addition$\boldsymbol {\delta }^2_1$ ).$\mathsf {DC}_{\mathbb {R}}$