相关论文: On universal graphs without cliques or withour lar…

We say that a plane set $A$ is {\it graph-null,} if there is a function $g\colon [0,1] \to \mathbb{R}$ such that $\lambda_2 (A+{\rm graph}\, g)=0$. A plane set $A$ has the {\it translational Kakeya property} if, for every translated copy…

For many classes of models, there are universal members in any cardinal $\lambda$ which "essentially satisfies GCH", i.e. $\lambda = 2^{< \lambda}$, in particular for the class of a complete first order $T$ (well, if at least $\lambda >…

Given a $k$-graph $\Lambda$ and an element $p$ of $\NN^k$, we define the dual $k$-graph, $p\Lambda$. We show that when $\Lambda$ is row-finite and has no sources, the $C^*$-algebras $C^*(\Lambda)$ and $C^*(p\Lambda)$ coincide. We use this…

Let G be a finite group with identity e and H \neq \{e\} be a subgroup of G. The generalized non-coprime graph GAmma_{G,H} of G with respect to H is the simple undirected graph with G - \{e \}\) as the vertex set and two distinct vertices a…

A widely open conjecture proposed by Bollob\'as, Erd\H{o}s, and Tuza in the early 1990s states that for any $n$-vertex graph $G$, if the independence number $\alpha(G) = \Omega(n)$, then there is a subset $T \subseteq V(G)$ with $|T| =…

Let $M$ denote the Merimovich's model in which for each infinite cardinal $\lambda, 2^\lambda=\lambda^{+3}$. We show that in $M$ the following hold: (1) Shelah's strong hypothesis fails at all singular cardinals, indeed, $\forall \lambda…

Let kappa be an uncountable cardinal and the edges of a complete graph with kappa vertices be colored with aleph_0 colors. For kappa >2^{aleph_0} the Erd\H{o}s-Rado theorem implies that there is an infinite monochromatic subgraph. However,…

We prove that for infinite cardinals $\kappa<\lambda$ the alternating group $Alt(\lambda)$ (of even permutations) of $\lambda$ is not embeddable into the symmetric group $Sym(\kappa)$ (of all permutations) of $\kappa$. To prove this fact we…

We present an infinite sequence of finite graphs with trivial automorphism group and non-trivial quantum automorphism group. These are the first known examples of graphs with this property. Moreover, to the best of our knowledge, these are…

A graph $G$ is called universal for a family of graphs $\mathcal{F}$ if it contains every element $F \in \mathcal{F}$ as a subgraph. Let $\mathcal{F}(n,2)$ be the family of all graphs with maximum degree $2$. Ferber, Kronenberg, and Luh…

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…

Lovasz and Plummer conjectured that there exists a fixed positive constant c such that every cubic n-vertex graph with no cutedge has at least 2^(cn) perfect matchings. Their conjecture has been verified for bipartite graphs by Voorhoeve…

A graph $G$ is said to be $\mathcal H(n,\Delta)$-universal if it contains every graph on $n$ vertices with maximum degree at most $\Delta$. It is known that for any $\varepsilon > 0$ and any natural number $\Delta$ there exists $c > 0$ such…

We answer a variant of a question of Rodl and Voigt by showing that, for a given infinite cardinal lambda, there is a graph G of cardinality kappa =(2^lambda)^+ such that for any colouring of the edges of G with lambda colours, there is an…

The Erd\H{o}s-Simonovits stability theorem states that for all \epsilon >0 there exists \alpha >0 such that if G is a K_{r+1}-free graph on n vertices with e(G) > ex(n,K_{r+1}) - \alpha n^2, then one can remove \epsilon n^2 edges from G to…

Suppose that $\lambda=\lambda^{<\lambda} \ge\aleph_0$, and we are considering a theory $T$. We give a criterion on $T$ which is sufficient for the consistent existence of $\lambda^{++}$ universal models of $T$ of size $\lambda^+$ for models…

We show that for any claw-free graph $G$ and any graph $H$, $\gamma(G\square H)\geq \frac{2}{3}\gamma(G)\gamma(H)$, where $\gamma(G)$ is the domination number of $G$.

A graph K is square-free if it contains no four-cycle as a subgraph. A graph K is multiplicative if GxH -> K implies G -> K or H -> K, for all graphs G,H. Here GxH is the tensor (or categorical) graph product and G -> K denotes the…

We produce a complete descrption of the lattice of gauge-invariant ideals in $C^*(\Lambda)$ for a finitely aligned $k$-graph $\Lambda$. We provide a condition on $\Lambda$ under which every ideal is gauge-invariant. We give conditions on…

We conjecture that the balanced complete bipartite graph $K_{\lfloor n/2 \rfloor,\lceil n/2 \rceil}$ contains more cycles than any other $n$-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent…