Related papers: Identities on cardinals less than aleph_omega
Hoffman proved that for a simple graph $G$, the chromatic number $\chi(G)$ obeys $\chi(G) \le 1 - \frac{\lambda_1}{\lambda_{n}}$ where $\lambda_1$ and $\lambda_n$ are the maximal and minimal eigenvalues of the adjacency matrix of $G$…
In an $r$-coloring of edges of the complete graph on $n$ vertices, how many edges are there in the largest monochromatic connected component? A construction of Gy\'arf\'as shows that for infinitely many values of $r$, there exist colorings…
We investigate the existence of perfect homogeneous sets for analytic colorings. An analytic coloring of X is an analytic subset of [X]^N, where N>1 is a natural number. We define an absolute rank function on trees representing analytic…
This paper studies short brooms in edge-chromatic critical graphs. We prove that for any short broom in a $\Delta$-critical graph, at most one color is missing at more than one vertex. Moreover, this color (if exists) is missing at exactly…
We show relative to strong hypotheses that patterns of compact cardinals in the universe, where a compact cardinal is one which is either strongly compact or supercompact, can be virtually arbitrary. Specifically, we prove if V is a model…
The acyclic chromatic number of a graph is the least number of colors needed to properly color its vertices so that none of its cycles has only two colors. We show that for all $\alpha>2^{-1/3}$ there exists an integer $\Delta_{\alpha}$…
The rainbow connection number, $rc(G)$, of a connected graph $G$ is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least one path in which no two edges are colored the same. We show…
Deciding whether a planar graph (even of maximum degree $4$) is $3$-colorable is NP-complete. Determining subclasses of planar graphs being $3$-colorable has a long history, but since Gr\"{o}tzsch's result that triangle-free planar graphs…
The {\em Singular Cardinal Hypothesis} (SCH) is one of the most classical combinatorial principles in set theory. It says that if $\kappa$ is singular strong limit, then $2^{\kappa}=\kappa^+$. We prove that given a singular cardinal…
A graph is called odd (respectively, even) if every vertex has odd (respectively, even) degree. Gallai proved that every graph can be partitioned into two even induced subgraphs, or into an odd and an even induced subgraph. We refer to a…
Ramsey's theorem for pairs asserts that every 2-coloring of the pairs of integers has an infinite monochromatic subset. In this paper, we study a strengthening of Ramsey's theorem for pairs due to Erdos and Rado, which states that every…
Gallai's colouring theorem states that if the edges of a complete graph are 3-coloured, with each colour class forming a connected (spanning) subgraph, then there is a triangle that has all 3 colours. What happens for more colours: if we…
A path (cycle) in a $2$-edge-colored multigraph is alternating if no two consecutive edges have the same color. The problem of determining the existence of alternating Hamiltonian paths and cycles in $2$-edge-colored multigraphs is an…
For a hypergraph $H$, let $q(H)$ denote the expected number of monochromatic edges when the color of each vertex in $H$ is sampled uniformly at random from the set of size 2. Let $s_{\min}(H)$ denote the minimum size of an edge in $H$.…
Erd\H{o}s and Simonovits asked the following question: For an integer $r\geq 2$ and a family of non-bipartite graphs $\mathcal{H}$, determine the infimum of $\alpha$ such that any $\mathcal{H}$-free $n$-vertex graph with minimum degree at…
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$,…
We show that it is consistent that the continuum is as large as you wish, and for each uncountable cardinal $\kappa$ below the continuum, there are a subset $T$ of the reals and a family $A$ of countable subsets of $T$ such that (1) both…
Haviv ({\em European Journal of Combinatorics}, 2019) has recently proved that some topological lower bounds on the chromatic number of graphs are also lower bounds on their orthogonality dimension over $\mathbb{R}$. We show that this holds…
Given an edge colouring of a graph with a set of $m$ colours, we say that the graph is $m$-\textit{coloured} if each of the $m$ colours is used. For an $m$-colouring $\Delta$ of $\mathbb{N}^{(2)}$, the complete graph on $\mathbb{N}$, we…
Motivated by two open questions about two-cardinal tree properties, we introduce and study generalized narrow system properties. The first of these questions asks whether the strong tree property at a regular cardinal $\kappa \geq \omega_2$…