Related papers: Farey-subgraphs and Continued Fractions
Fractional matching extendability is a concept that brings together two widely studied topics in graph theory, namely that of fractional matchings and that of matching extendability. A {\em fractional matching} of a graph $\Gamma$ with edge…
In this paper, we clarified the relationship between continued fractions, determinants, and identities, making it easier to apply these methods systematically in other settings. In particular, we studied finite continued fractions from the…
In this article, we study the pair correlation of Farey fractions by proving that the limiting pair correlation function of the sequence of Farey fractions with square-free denominators exists and provide an explicit formula for the…
For a finite family $\mathcal{F}$ of fixed graphs let $R_k(\mathcal{F})$ be the smallest integer $n$ for which every $k$-coloring of the edges of the complete graph $K_n$ yields a monochromatic copy of some $F\in\mathcal{F}$. We say that…
In this paper, we will first summarize known results concerning continued fractions. Then we will limit our consideration to continued fractions of quadratic numbers. The second author described periods and sometimes precise form of…
As the conclusion of a line of investigation undertaken in two previous papers, we compute asymptotic frequencies for the values taken by numerators of differences of consecutive Farey fractions with denominators restricted to lie in…
We construct a countable planar graph which, for any two vertices $u,v$ and any integer $k\ge 1$, contains $k$ edge-disjoint order-compatible $u$--$v$ paths but not infinitely many. This graph has applications in Ramsey theory, in the study…
Let $R(G)$ be the two-colour Ramsey number of a graph $G$. In this note, we prove that for any non-decreasing function $n \leq f(n) \leq R(K_n)$, there exists a sequence of connected graphs $(G_n)_{n\in\mathbb N}$, with $|V(G_n)| = n$ for…
In this article, we present a binary tree with vertices given by rational functions $p(x)/q(x)$; the root and functional derivation of children are inspired by continued fractions. We prove some special properties of the tree. For example,…
Given a formation $\mathfrak F$, we consider the graph whose vertices are the elements of $G$ and where two vertices $g,h\in G$ are adjacent if and only if $\langle g,h \rangle \notin\mathfrak F$. We are interested in the two following…
Let $n$ be any positive integer, the friendship graph $F_n$ consist of $n$ edge-disjoint triangles that all of them meeting in one vertex. A graph $G$ is called cospectral with a graph $H$ if their adjacency matrices have the same…
Farey's sequence is a well-known procedure used to generate proper fractions from 0 to 1. Farey sequence is commonly used in rational approximations of irrational numbers, ford circles and in Riemann hypothesis. Thus, in this paper, we aim…
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.
A classical vertex Ramsey result due to Ne\v{s}et\v{r}il and R\"odl states that given a finite family of graphs $\mathcal{F}$, a graph $A$ and a positive integer $r$, if every graph $B\in\mathcal{F}$ has a $2$-vertex-connected subgraph…
For a fixed positive integer d, we show the existence of the limiting gap distribution measure for the sets of Farey fractions a/q of order Q with a not divisible by d, and respectively with q relatively prime with d, as Q tends to…
The first part of this note is a short introduction on continued fraction expansions for certain algebraic power series. In the last part, as an illustration, we present a family of algebraic continued fractions of degree 4, including a toy…
A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We construct families of non-hamiltonian graphs for which the ratio…
Continued fractions whose elements are polynomial sequences have been carefully studied mostly in the cases where the degree of the numerator polynomial is less than or equal to two and the degree of the denominator polynomial is less than…
The continued fraction mapping maps a number in the interval $[0,1)$ to the sequence of its partial quotients. When restricted to the set of irrationals, which is a subspace of the Euclidean space $\mathbb{R}$, the continued fraction…
We study the basic properties of a prime sum graph, which is a simple graph defined on $\mathbb N$ where two vertices are adjacent if and only if their sum is a prime number. Further, we investigate some specific structures that appear…