Related papers: Universality among the graph omitting a complete b…

Let $G$ be a finite, undirected $d$-regular graph and $A(G)$ its normalized adjacency matrix, with eigenvalues $1 = \lambda_1(A)\geq \dots \ge \lambda_n \ge -1$. It is a classical fact that $\lambda_n = -1$ if and only if $G$ is bipartite.…

We define strongly chordal digraphs, which generalize strongly chordal graphs and chordal bipartite graphs, and are included in the class of chordal digraphs. They correspond to square 0,1 matrices that admit a simultaneous row and column…

A longstanding open question of Archdeacon and Craft asks whether every complete graph has a minimum genus embedding with at most one nontriangular face. We exhibit such an embedding for each complete graph except $K_8$, the complete graph…

We answer a question of Usuba by showing that the combinatorial principle $UB_\lambda$ can fail at a singular cardinal. Furthermore, $\lambda$ can be taken to be $\aleph_\omega.$

We continue the investigations in the author's book on cardinal arithmetic, assuming some knowledge of it. We deal with the cofinality of (S_{<= aleph_0}(kappa), subseteq) for kappa real valued measurable (Section 3), densities of box…

Induced bipartite subgraphs of maximal vertex cardinality are an essential concept for the analysis of graphs. Yet, discovering them in large graphs is known to be computationally hard. Therefore, we consider in this work a weaker notion of…

One of the numerous characterizations of a Ramsey cardinal kappa involves the existence of certain types of elementary embeddings for transitive sets of size \kappa satisfying a large fragment of ZFC. We introduce new large cardinal axioms…

A universal representation theorem is derived that shows any graph is the intersection graph of one chordal graph, a number of co-bipartite graphs, and one unit interval graph. Central to the the result is the notion of the clique cover…

The Gamma-Theta Conjecture states that if the domination number of a graph is equal to its eternal domination number, then it is also equal to its clique covering number. This conjecture is known to be true for several graph classes, such…

We apply model theoretic methods to the problem of existence of countable universal graphs with finitely many forbidden connected subgraphs. We show that to a large extent the question reduces to one of local finiteness of an…

We study the existence of perfect matchings in suitably chosen induced subgraphs of random biregular bipartite graphs. We prove a result similar to a classical theorem of Erdos and Renyi about perfect matchings in random bipartite graphs.…

Assuming that there is no inner model with a Woodin cardinal, we obtain a characterization of $\lambda$-tall cardinals in extender models that are iterable. In particular we prove that in such extender models, a cardinal $\kappa$ is a tall…

Let $(\mathcal{K} ,\subseteq )$ be a universal class with $LS(\mathcal{K})=\lambda$ categorical in regular $\kappa >\lambda^+$ with arbitrarily large models, and let $\mathcal{K}^*$ be the class of all $\mathcal{A}\in\mathcal{K}_{>\lambda}$…

We show that the problem of counting perfect matchings remains #P-complete even if we restrict the input to very dense graphs, proving the conjecture in [5]. Here "dense graphs" refer to bipartite graphs of bipartite independence number…

We show that extending an embedding of a graph $\Gamma$ in a surface to an embedding of a Hamiltonian supergraph can be blocked by certain planar subgraphs but, for some subdivisions of $\Gamma$, Hamiltonian extensions must exist.

Let $\Gamma^\infty$ be the set of all universally Baire sets of reals. Inspired by recent work of the second author and Nam Trang, we introduce a new technique for establishing generic absoluteness results for models containing…

The \emph{Antimagic Graph Conjecture} asserts that every connected graph $G = (V, E)$ except $K_2$ admits an edge labeling such that each label $1, 2, ..., |E|$ is used exactly once and the sums of the labels on all edges incident with a…

We continue our study of Sierpinski-type colourings. In contrast to the prequel paper, we focus here on colourings for ideals stratified by their completeness degree. In particular, improving upon Ulam's theorem and its extension by Hajnal,…

We extend prior results of Cody-Eskew, showing the consistency of GCH with the statement that for all regular cardinals $\kappa \leq \lambda$, where $\kappa$ is the successor of a regular cardinal, there is a rigid saturated ideal on…

We show that generalized eventually narrow sequences on a strongly inaccessible cardinal $\kappa$ are preserved under the Cummings-Shaleh non-linear iterations of the higher Hechler forcing on $\kappa$. Moreover assuming GCH,…