Related papers: Cardinal invariants of closed graphs
We determine the excluded minors characterising the class of countable graphs that embed into some compact surface.
The independence number of a graph G, denoted by alpha(G), is the cardinality of an independent set of maximum size in G, while mu(G) is the size of a maximum matching in G, i.e., its matching number. G is a Konig-Egervary graph if its…
For a given positive integer t we consider graphs having maximal independent sets of precisely t distinct cardinalities and restrict our attention to those that have no vertices of degree one. In the situation when t is four or larger and…
We show that, given an infinite cardinal $\mu$, a graph has colouring number at most $\mu$ if and only if it contains neither of two types of subgraph. We also show that every graph with infinite colouring number has a well-ordering of its…
Suppose a graph has no large balanced bicliques, but has large minimum degree. Then what can we say about its induced subgraphs? This question motivates the study of degree-boundedness, which is like $\chi$-boundedness but for minimum…
In this paper uniquely list colorable graphs are studied. A graph G is called to be uniquely k-list colorable if it admits a k-list assignment from which G has a unique list coloring. The minimum k for which G is not uniquely k-list…
We show that it is consistent that for some uncountable cardinal k, all compactifications of the countable discrete space with remainders homeomorphic to $D^k$ are homeomorphic to each other. On the other hand, there are $2^c$ pairwise…
We show, assuming the consistency of one measurable cardinal, that it is consistent for there to be exactly kappa+ many normal measures on the least measurable cardinal kappa. This answers a question of Stewart Baldwin. The methods…
In this paper, we show that the existence of certain first-countable compact-like extensions is equivalent to the equality between corresponding cardinal characteristics of the continuum. For instance, $\mathfrak b=\mathfrak s=\mathfrak c$…
For a graph invariant $\pi$, the Contraction($\pi$) problem consists in, given a graph $G$ and two positive integers $k,d$, deciding whether one can contract at most $k$ edges of $G$ to obtain a graph in which $\pi$ has dropped by at least…
We show that many large cardinal notions can be characterized in terms of the existence of certain elementary embeddings between transitive set-sized structures, that map their critical point to the large cardinal in question. In…
Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $D\subseteq V$ such that every vertex not in $D$ is adjacent to at least one vertex in $D$. The cardinality of a smallest dominating set of $G$, denoted by $\gamma(G)$, is…
We discuss the minimal number of vertices in a graph with a large chromatic number such that each ball of a fixed radius in it has a small chromatic number. It is shown that for every graph $G$ on $\sim((n+rc)/(c+rc))^{r+1}$ vertices such…
For a given graph consider a pair of disjoint matchings the union of which contains as many edges as possible. Furthermore, consider the relation of the cardinalities of a maximum matching and the largest matching in those pairs. It is…
A group of permutations G of a set V is k-distinguishable if there exists a partition of V into k parts such that only the identity permutation in G fixes setwise all of the cells of the partition. The least cardinal number k such that…
In this paper we are interested in finding and evaluating cardinal characteristics of the continuum that appear in large-scale topology, usually as the smallest weights of coarse structures that belong to certain classes (indiscrete,…
A class of graphs G is chi-bounded if the chromatic number of graphs in G is bounded by a function of the clique number. We show that if a class G is chi-bounded,then every class of graphs admitting a decomposition along cuts of small rank…
If it is consistent that there is a measurable cardinal, then it is consistent that all points g-delta Rothberger spaces have "small" cardinality.
In [CMRM24], it was proved that it is relatively consistent that \emph{bounding number} $\mathfrak{b}$ is smaller than the uniformity of $\mathcal{MA}$, where $\mathcal{MA}$ denotes the ideal of the meager-additive sets of $2^{\omega}$. To…
Given two sets $A$ and $B$ of integers, we consider the problem of finding a set $S \subseteq A$ of the smallest possible cardinality such the greatest common divisor of the elements of $S \cup B$ equals that of those of $A \cup B$. The…