Related papers: There is No McLaughlin Geometry
The problem of recognizing (k, l)-tight graphs is a fundamental problem that has close connections to well studied problems like graph rigidity. The problem is better understood for planar graphs as compared to general graphs. For example,…
Twelve new strongly regular graphs with parameters (81,30,9,12) are found as graphs invariant under certain subgroups of the automorphism groups of the two previously known graphs that arise from 2-weight codes. One of these new graphs is…
Highly regular graphs for which not all regularities are explainable by symmetries are fascinating creatures. Some of them like, e.g., the line graph of W.~Kantor's non-classical $\mathrm{GQ}(5^2,5)$, are stumbling stones for existing…
In this paper, we study the nonexistence of solutions to semilinear elliptic equations with a positive potential on metric graphs. In particular, the Laplacian under consideration is of a special type, related to both the vertices and edges…
A $k$-regular graph of girth $g$ is called vertex-girth-regular if every vertex is contained in the same number of cycles of length $g$. For integers $n, k, g$ and $\lambda$, we denote such a graph on $n$ vertices in which every vertex lies…
The maximal graph Dirichlet problem asks whether there exists a spacelike graph, in a semi-Euclidean space, with a given boundary and with mean curvature everywhere zero. We prove the existence of solutions to this problem under certain…
Existing graph theoretic approaches are mainly restricted to floor-plans with rectangular boundary. In this paper, we introduce floor-plans with $L$-shaped boundary (boundary with only one concave corner). To ensure the L-shaped boundary,…
We prove that there exists a constant $\gamma_{\mathrm{crit}}\approx .17566$ such that if $G\sim \mathbb{G}(n,1/2)$ then for any $\varepsilon > 0$ with high probability $G$ has a equipartition such that each vertex has…
The point-line geometry known as a \textit{partial quadrangle} (introduced by Cameron in 1975) has the property that for every point/line non-incident pair $(P,\ell)$, there is at most one line through $P$ concurrent with $\ell$. So in…
In this paper we are concerned with the problem of finding hypersurfaces of constant curvature and prescribed boundary in the Euclidean space, using the theory of fully nonlinear elliptic equations. We prove that if the given data admits a…
We prove that if $ T $ is a semi-special tree that is not special, then there exists a graph $ G $, formed as an inflation of a sparse $ T $-graph, such that for any special tree $ S $, $ G $ is not a subdivision of an inflation of an…
A graph is square-complementary (squco, for short) if its square and complement are isomorphic. We prove that there are no squco graphs with girth 6, that every bipartite graph is an induced subgraph of a squco bipartite graph, that the…
We present a new non-existence proof for the strongly regular graph $G$ with parameters $(76,21,2,7)$, using the unit vector representation of the graph.
A $t$-nearly platonic graph is a finite, connected, regular, simple and planar graph in which all but exactly $t$ numbers of its faces have the same length. It is proved that there is no 2-connected $1$-nearly platonic graph. In this paper,…
A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions regarding longest paths and longest cycles, for instance…
It is shown that the geometric constraint advocated in [R. S. Kaushal, Mod. Phys. Lett. A 15 (2000) 1391] is trivially satisfied. Therefore, such a constraint does not exist. We also point out another flaw in Kaushal's paper.
We give a simple proof of MacLane's algebraic planarity criterion for graphs. This proof does not use any other known planarity criteria. Keywords: graph, planarity, cycle space, a simple basis of a graph.
We prove the non-existence of elliptic curves having good reduction everywhere over some real quadratic fields.
We investigate nonexistence of nontrivial nonnegative solutions to a class of semilinear parabolic equations with a positive potential, posed on weighted graphs. Assuming an upper bound on the Laplacian of the distance and a suitable…
A simplified version of the theory of strongly regular graphs is developed for the case in which the graphs have no triangles. This leads to (i) direct proofs of the Krein conditions, and (ii) the characterization of strongly regular graphs…