Related papers: Flip-Flop Sublinear Models for Graphs: Proof of Th…

We characterize the vertices belonging to all minimum dominating sets, to some minimum dominating sets but not all, and to no minimum dominating set. We refine this characterization for some well studied sub-classes of graphs: chordal,…

We consider the class ${\cal A}$ of graphs that contain no odd hole, no antihole, and no "prism" (a graph consisting of two disjoint triangles with three disjoint paths between them). We prove that every graph $G\in{\cal A}$ different from…

We give a complete and careful proof of Quillen's theorem on the existence of the standard model category structure on the category of topological spaces. We do not assume any familiarity with model categories.

It is known that complete graphs and complete multipartite graphs have modularity zero. We show that the least number of edges we may delete from the complete graph $K_n$ to obtain a graph with non-zero modularity is $\lfloor n/2\rfloor…

All finite simple self $2$-distance graphs with no $4$-cycle, diamond, or triangles with a common vertex are determined. Utilizing these results, it is shown that there is no cubic self $2$-distance graphs.

In this paper, we prove that there does not exist a subgroup H of a finite group G such that the number of isomorphism classes of right transversals of H in G is two.

We prove for every graph H there exists a>0 such that, for every graph G with at least two vertices, if no induced subgraph of G is a subdivision of H, then either some vertex of G has at least a|G| neighbours, or there are two disjoint…

We consider infinite connected quasi-transitive locally finite graphs and show that every such graph with more than one end is a tree amalgamation of two other such graphs. This can be seen as a graph-theoretical version of Stallings'…

We deal with consistency results for the existence of universal models in natural classes of models (more exactly--a somewhat weaker version). We apply a result on quite general family to T_feq and to the class of triangle-free graphs.

We prove that a graph has an r-bounded subdivision of a wheel if and only if it does not have a graph-decomposition of locality r and width at most two.

We prove that every claw-free graph $G$ that doesn't contain a clique on $\Delta(G) \geq 9$ vertices can be $\Delta(G) - 1$ colored.

In this paper we prove that there are finitely many modular curves that admit a smooth plane model. Moreover, if the degree of the model is greater than or equal to 19, no such curve exists. For modular curves of Shimura type we show that…

We introduce a new class of graphs which we call P-transitive graphs, lying between transitive and 3-transitive graphs. First we show that the analogue of de Jongh-Sambin Theorem is false for wellfounded P-transitive graphs; then we show…

It is shown that the ultimate version of the nonlinear Pietsch Domination Theorem remains true, even in a stronger presentation, if one of its hypotheses is removed. More precisely, we show that no trace of (sub)-homogeneity assumption is…

It is proved that every series-parallel digraph whose maximum vertex-degree is $\Delta$ admits an upward planar drawing with at most one bend per edge such that each edge segment has one of $\Delta$ distinct slopes. This is shown to be…

We construct minor-closed addable families of graphs that are subcritical and contain all planar graphs. This contradicts (one direction of) a well-known conjecture of Noy.

Let $\mathcal{F}$ be a family of fixed graphs and let $d$ be large enough. For every $d$-regular graph $G$, we study the existence of a spanning $\mathcal{F}$-free subgraph of $G$ with large minimum degree. This problem is well-understood…

This is the continuation of the article by the author that proves a broader class of families admitting the theorem of restriction of sections other than Abelian varieties and gives new examples of pseudo-N\'eron models. In this work, we…

Almost $4$-connectivity is a weakening of $4$-connectivity which allows for vertices of degree three. In this paper we prove the following theorem. Let $G$ be an almost $4$-connected triangle-free planar graph, and let $H$ be an almost…

We investigate the analogy between squarefree Cohen-Macaulay modules supported on a graph and line bundles on a curve. We prove a Riemann-Roch theorem, we study the Jacobian and gonality of a graph, and we prove Clifford's theorem.