相关论文: On Taylor's problem

We prove that the existence of a non-special tree of size $\lambda$ is equivalent to the existence of an uncountably chromatic graph with no $K_{\omega_1}$ minor of size $\lambda$, establishing a connection between the special tree number…

An edge coloring of a graph $G$ is a Gallai coloring if it contains no rainbow triangle. We show that the number of Gallai $r$-colorings of $K_n$ is $\left(\binom{r}{2}+o(1)\right)2^{\binom{n}{2}}$. This result indicates that almost all…

For any countably infinite graph $G$, Ramsey's theorem guarantees an infinite monochromatic copy of $G$ in any $r$-coloring of the edges of the countably infinite complete graph $K_\mathbb{N}$. Taking this a step further, it is natural to…

We introduce the decomposability spectrum $K_D=\{\lambda \geq \omega| D \text{is} \lambda\text{-decomposable}\}$ of an ultrafilter $D$, and show that Shelah's $\pcf$ theory influences the possible values $K_D$ can take. For example, we show…

A class of graphs $\cal G$ is said to be \emph{near optimal colorable} if there exists a constant $c\in \mathbb{N}$ such that every graph $G\in \cal G$ satisfies $\chi(G) \leq \max\{c, \omega(G)\}$, where $\chi(G)$ and $\omega(G)$…

We prove a conjecture of Andras Gyarfas, that for all k,t, every graph with clique number at most k and sufficiently large chromatic number has an odd hole of length at least t.

Various results ensure the existence of large complete bipartite graphs in properly colored graphs when some condition related to a topological lower bound on the chromatic number is satisfied. We generalize three theorems of this kind,…

For any regular cardinal $\kappa$ and ordinal $\eta<\kappa^{++}$ it is consistent that $2^{\kappa}$ is as large as you wish, and every function $f:\eta \to [\kappa,2^{\kappa}]\cap Card$ with $f(\alpha)=\kappa$ for $cf(\alpha)<\kappa$ is the…

A graph $G$ is $k$-vertex-critical if $\chi(G)=k$ but $\chi(G-v)<k$ for all $v\in V(G)$. In this paper we make progress on the open problem of the finiteness of $k$-vertex-critical $(P_4+\ell P_1)$-free graphs by showing that there are only…

Halin proved that every graph with an end $\omega$ containing infinitely many pairwise disjoint rays admits a subdivision of the infinite quarter-grid as a subgraph where all rays from that subgraph belong to $\omega$. We will prove a…

The number of homomorphisms from a finite graph $F$ to the complete graph $K_n$ is the evaluation of the chromatic polynomial of $F$ at $n$. Suitably scaled, this is the Tutte polynomial evaluation $T(F;1-n,0)$ and an invariant of the cycle…

For an arbitrary infinite cardinal $\kappa$, we define classes of coordinatewise $\kappa$-slender and tailwise $\kappa$-slender modules as well as related classes of $h\kappa$-modules and initiate a study of these classes.

For each infinite cardinal k, the set of algebraic hypergraphs having chromatic number no larger than k is decidable.

Every end of an infinite graph $ G $ defines a tangle of infinite order in $ G $. These tangles indicate a highly cohesive substructure in the graph if and only if they are closed in some natural topology. We characterize, for every finite…

The codegree Tur\'an density $\gamma(F)$ of a $k$-graph $F$ is the smallest $\gamma\in[0,1)$ such that every $k$-graph $H$ with $\delta_{k-1}(H)\geq(\gamma+o(1))\vert V(H)\vert$ contains a copy of $F$. We prove that for all…

We prove that for $n>k\geq 3$, if $G$ is an $n$-vertex graph with chromatic number $k$ but any its proper subgraph has smaller chromatic number, then $G$ contains at most $n-k+3$ copies of cliques of size $k-1$. This answers a problem of…

We fully disprove a conjecture of Haythorpe on the minimum number of hamiltonian cycles in regular hamiltonian graphs, thereby extending a result of Zamfirescu, as well as correct and complement Haythorpe's computational enumerative results…

We deal with several pcf problems; we characterize another version of exponentiation: number of kappa-branches in a tree with lambda nodes, deal with existence of independent sets in stable theories, possible cardinality of ultraproduct,…

We prove #P-completeness results for counting edge colorings on simple graphs. These strengthen the corresponding results on multigraphs from [4]. We prove that for any $\kappa \ge r \ge 3$ counting $\kappa$-edge colorings on $r$-regular…

We prove two ZFC theorems about cardinal invariants above the continuum which are in sharp contrast to well-known facts about these same invariants at the continuum. It is shown that for an uncountable regular cardinal $\kappa$,…