English
Related papers

Related papers: Identities on cardinals less than aleph_omega

200 papers

We study several basic problems about colouring the $p$-random subgraph $G_p$ of an arbitrary graph $G$, focusing primarily on the chromatic number and colouring number of $G_p$. In particular, we show that there exist infinitely many…

Combinatorics · Mathematics 2025-07-02 Boris Bukh , Michael Krivelevich , Bhargav Narayanan

An $r$-edge coloring of a graph or hypergraph $G=(V,E)$ is a map $c:E\to \{0, \dots, r-1\}$. Extending results of Rado and answering questions of Rado, Gy\'arf\'as and S\'ark\"ozy we prove that (1.) the vertex set of every $r$-edge colored…

Combinatorics · Mathematics 2016-01-07 M. Elekes , D. T. Soukup , L. Soukup , Z. Szentmiklóssy

Assuming $\kappa$ is a supercompact cardinal and $\lambda$ is an inaccessible cardinal above it, we present an idea due to Magidor, to find a generic extension in which $\kappa=\aleph_\omega$ and $\lambda=\aleph_{\omega+1}.$

Logic · Mathematics 2017-11-15 Mohammad Golshani

A. Hajnal and P. Erd\H{o}s proved that a graph with uncountable chromatic number cannot avoid short cycles, it must contain for example $ C_4 $ (among other obligatory subgraphs). It was shown recently by D. T. Soukup that, in contrast of…

Combinatorics · Mathematics 2023-06-16 Attila Joó

For fixed positive integers $r, k$ and $\ell$ with $1 \leq \ell < r$ and an $r$-uniform hypergraph $H$, let $\kappa (H, k,\ell)$ denote the number of $k$-colorings of the set of hyperedges of $H$ for which any two hyperedges in the same…

Combinatorics · Mathematics 2011-03-01 Carlos Hoppen , Yoshiharu Kohayakawa , Hanno Lefmann

We generalize a result of Tibor Gallai as follows: for any finite set of points $\mathcal{S}$ in the plane, if the plane is colored in finitely many colors, then there exist $2^{\aleph_0}$ monochromatic subsets of the plane homothetic to…

Combinatorics · Mathematics 2015-08-11 Jeremy F. Alm

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

Logic · Mathematics 2016-07-06 James H. Schmerl

For a regular uncountable cardinal kappa, we discuss the order relationship between the unbounding and dominating numbers on kappa and cardinal invariants of the higher meager ideal M_kappa. In particular, we obtain a complete…

Logic · Mathematics 2022-02-03 Joerg Brendle

Given a graph $G$, a vertex-colouring $\sigma$ of $G$, and a subset $X\subseteq V(G)$, a colour $x \in \sigma(X)$ is said to be \emph{odd} for $X$ in $\sigma$ if it has an odd number of occurrences in $X$. We say that $\sigma$ is an…

Combinatorics · Mathematics 2023-06-05 Tianjiao Dai , Qiancheng Ouyang , François Pirot

We prove two $\mathrm{ZFC}$ inequalities between cardinal invariants. The first inequality involves cardinal invariants associated with an analytic P-ideal, in particular the ideal of subsets of $\omega$ of asymptotic density $0$. We obtain…

Logic · Mathematics 2015-05-26 Dilip Raghavan , Saharon Shelah

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…

Combinatorics · Mathematics 2018-08-16 Louis DeBiasio , Paul McKenney

Addressing a question of Erdos and Hajnal we show that one can force a graph with no large independent sets and no monochromatic triples as successors of strong limit singular cardinals, even without assuming GCH. The result can be pushed…

Logic · Mathematics 2025-02-25 Shimon Garti , Yair Hayut , Saharon Shelah

For any cardinal $\kappa \geq 2$, there is a unique complete real tree whose points all have valence $\kappa$. In this note, we show that, when $\kappa \geq 3$, it is necessary to assume completeness. More precisely, we show that there…

Metric Geometry · Mathematics 2025-11-06 Pénélope Azuelos

A proper vertex coloring $\varphi$ of graph $G$ is said to be odd if for each non-isolated vertex $x\in V(G)$ there exists a color $c$ such that $\varphi^{-1}(c)\cap N(x)$ is odd-sized. The minimum number of colors in any odd coloring of…

Combinatorics · Mathematics 2022-07-21 Yair Caro , Mirko Petruševski , Riste Škrekovski

For infinite cardinals $\kappa,\lambda$ let $C(\kappa,\lambda)$ denote the class of all compact Hausdorff spaces of weight $\kappa$ and size $\lambda$. So $C(\kappa,\lambda)=\emptyset$ if $\kappa>\lambda$ or $\lambda>2^\kappa$. If F is a…

General Topology · Mathematics 2025-12-17 Gerald Kuba

A graph/multigraph $G$ is locally irregular if endvertices of every its edge possess different degrees. The locally irregular edge coloring of $G$ is its edge coloring with the property that every color induces a locally irregular…

Combinatorics · Mathematics 2024-10-04 Igor Grzelec , Tomáš Madaras , Alfréd Onderko , Roman Soták

Given any $\lambda\leq\kappa$, we construct a symmetric extension in which there is a set $X$ such that $\aleph(X)=\lambda$ and $\aleph^*(X)=\kappa$. Consequently, we show that $\mathsf{ZF}+$"For all pairs of infinite cardinals…

Logic · Mathematics 2024-08-16 Asaf Karagila , Calliope Ryan-Smith

We study conditions on automorphisms of Boolean algebras of the form $P(\lambda)/I_\kappa$ (where $\lambda$ is an uncountable cardinal and $I_\kappa$ is the ideal of sets of cardinality less than $\kappa$) which allow one to conclude that a…

Logic · Mathematics 2015-08-31 Paul Larson , Paul McKenney

The structure of automorphism groups of $\kappa$-existentially closed groups are studied by Kaya-Kuzucuo\u{g}lu in 2022. It was proved that Aut(G) is the union of subgroups of level preserving automorphisms and $|Aut(G)|=2^\kappa$ whenever…

Logic · Mathematics 2024-09-04 Burak Kaya , Mahmut Kuzucuoğlu , Patrizia Longobardi , Mercede Maj

We construct a connected graph H such that (1) \chi(H) = \omega; (2) K_\omega, the complete graph on \omega points, is not a minor of H. Therefore Hadwiger's conjecture does not hold for graphs with infinite coloring number.

Combinatorics · Mathematics 2012-12-14 Dominic van der Zypen