text large_stringlengths 7 3.02k |
|---|
A labeling of a graph is a bijection from $E(G)$ to the set $\{1, 2,..., |E(G)|\}$. A labeling is \textit{antimagic} if for any distinct vertices $u$ and $v$, the sum of the labels on edges incident to $u$ is different from the sum of the labels on edges incident to $v$. |
We show that the skew-growth function of a dual Artin monoid of finite type P has exactly rank(P) =: l simple real zeros on the interval (0, 1]. The proofs for types A_l and B_l are based on an unexpected fact that the skew-growth functions, up to a trivial factor, are expressed by Jacobi polynomials due to a Rodrigue... |
A finite group G is called Schur, if every Schur ring over G is associated in a natural way with a regular subgroup of Sym(G) that is isomorphic to G. We prove that any nonabelian Schur group G is metabelian and the number of distinct prime divisors of the order of G does not exceed 7. |
In this article we prove the $e$-positivity of $G_{\mathbf{\nu}}[X;q+1]$ when $G_{\mathbf{\nu}}[X;q]$ is a vertical strip LLT polynomial. This property has been conjectured by Alexandersson and Panova, and by Garsia, Haglund, Qiu and Romero, and it implies several $e$-positivities conjectured by them and also by Berge... |
In this paper, we are concerned with mean hitting time $\langle\mathcal{H}\rangle$ for random walks on recursive growth tree networks that are built based on an arbitrary tree as the seed via implementing various primitive graphic operations, and propose a series of combinatorial techniques that are called Mapping Tran... |
Unitals can be obtained as closures of affine unitals via parallelisms. The isomorphism type of the closure depends on the chosen parallelism, which need not be unique. |
In this paper, we systematically study non-crossing chords of simple polygons in the plane. We first introduce the reduced Euler characteristic of a family of line-segments, and subsequently investigate the structure of the diagonals and epigonals of a polygon. |
Let $t$ be a positive real number. A graph is called \emph{$t$-tough} if the removal of any vertex set $S$ that disconnects the graph leaves at most $|S|/t$ components. |
The existence of acyclic complete matchings on the face poset of a regular CW complex implies that the underlying topological space of the CW complex is contractible by discrete Morse theory. <br>In this paper, we construct explicitly acyclic complete matchings on any non-trivial Bruhat interval $[v,w]$ based on any r... |
The Gyarfas-Sumner conjecture says that for every forest $H$, there is a function $f$ such that if $G$ is $H$-free then $\chi(G)\le f(\omega(G))$ (where $\chi, \omega$ are the chromatic number and the clique number of $G$). Louis Esperet conjectured that, whenever such a statement holds, $f$ can be chosen to be a poly... |
In mathematics, a dissection of a square (or rectangle) into non-congruent rectangles is a Mondrian partition. If all the rectangles have the same area, it is called a perfect Mondrian partition. |
The rational homology group of the order complex of non-even partitions of a finite set is calculated. A twisted version of the Goresky-MacPherson approach to similar homology calculations is proposed. |
A generalized Motzkin path, called G-Motzkin path for short, of length $n$ is a lattice path from $(0, 0)$ to $(n, 0)$ in the first quadrant of the XOY-plane that consists of up steps $\mathbf{u}=(1, 1)$, down steps $\mathbf{d}=(1, -1)$, horizontal steps $\mathbf{h}=(1, 0)$ and vertical steps $\mathbf{v}=(0, -1)$. An ... |
Let $G=(V,E)$ be a finite, connected graph. We consider a greedy selection of vertices: given a list of vertices $x_1, \dots, x_k$, take $x_{k+1}$ to be any vertex maximizing the sum of distances to the existing vertices and iterate: we keep adding the `most remote' vertex. |
Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $S\subseteq V$ such that every vertex not in $S$ is adjacent to at least one vertex in $S$. |
A graph $\Gamma$ is said to be stable if for the direct product $\Gamma\times\mathbf{K}_2$, ${\rm Aut}(\Gamma \times \mathbf{K}_2)$ is isomorphic to ${\rm Aut}(\Gamma) \times \mathbb{Z}_2$; otherwise, it is called unstable. An unstable graph is called non-trivially unstable when it is not bipartite and no two vertices... |
Let $A(G)$ be the adjacency matrix of graph $G$ with eigenvalues $\lambda_1(G), \lambda_2(G),..., \lambda_n(G)$ in non-increasing order. The number $S_k(G):=\sum_{i=1}^{n}\lambda_i^{k}(G)\, (k=0, 1,..., n-1)$ is called the $k$th spectral moment of $G$. |
Let $La(n,P)$ be the maximum size of a family of subsets of $[n]= \{1,2, ..., n \}$ not containing $P$ as a (weak) subposet, and let $h(P)$ be the length of a longest chain in $P$. The best known upper bound for $La(n,P)$ in terms of $|P|$ and $h(P)$ is due to Chen and Li, who showed that $La(n,P) \le \frac{1}{m+1} \l... |
We show that the independence number of $ G_{n,p}$ is concentrated on two values if $ n^{-2/3+ \epsilon} < p \le 1$. This result is roughly best possible as an argument of Sah and Sawhney shows that the independence number is not, in general, concentrated on 2 values for $ p = o \left( (\log(n)/n)^{2/3} \right)$. |
In this paper, we obtain a number of new infinite families of Hadamard matrices. Our constructions are based on four new constructions of difference families with four or eight blocks. |
We study the class of all finite directed graphs up to primitive positive constructability. The resulting order has a unique greatest element, namely the graph $P_1$ with one vertex and no edges. |
The $g$-component edge connectivity $c\lambda_g(G)$ of a non-complete graph $G$ is the minimum number of edges whose deletion results in a graph with at least $g$ components. In this paper, we determine the component edge connectivity of the folded hypercube $c\lambda_{g+1}(FQ_{n})=(n+1)g-(\sum\limits_{i=0}^{s}t_i2^{t... |
The spread of a graph $G$ is the difference between the largest and smallest eigenvalues of the adjacency matrix of $G$. In this paper, we consider the family of graphs which contain no $K_{2,t}$-minor. |
Recent developments in particle physics have revealed deep connections between scattering amplitudes and tropical geometry. From the heart of this relationship emerged the chirotropical Grassmannian $\text{Trop}^\chi \text{G}(k,n)$ and the chirotropical Dressian $\text{Dr}^\chi(k,n)$, polyhedral fans built from unifor... |
The \textit{minimum positive co-degree} of a non-empty $r$-graph $H$, denoted $\delta_{r-1}^+(H)$, is the largest integer $k$ such that if a set $S \subset V(H)$ of size $r-1$ is contained in at least one $r$-edge of $H$, then $S$ is contained in at least $k$ $r$-edges of $H$. Motivated by several recent papers which ... |
Bennett, Hart, Iosevich, Pakianathan, and Rudnev found an exponent $s<d$ such that any set $E\subset \mathbb{F}_q^d$ with $|E|\gtrsim q^s$ determines $\gtrsim q^{\binom{k+1}{2}}$ congruence classes of $(k+1)$-point configurations for $k\leq d$. Because congruence classes can be identified with tuples of distances b... |
In some recent papers the classical `splitting necklace theorem' is linked in an interesting way with a geometric `pattern avoidance problem'. We explore the topological constraints on the existence of a (relaxed) measurable coloring of R^d such that any two distinct, non-degenerate cubes (parallelepipeds) are... |
Counting dominating sets in a graph $G$ is closely related to the neighborhood complex of $G$. We exploit this relation to prove that the number of dominating sets $d(G)$ of a graph is determined by the number of complete bipartite subgraphs of its complement. |
In a delightful article, Richard Stanley derived, algebraically, the surprisingly simple formula, 3 times 7 to the power n-1, for the sum of the cubes of the n-th row of Stern's diatomic array. In this note, we find an elegant bijective proof of this surprising fact, that explains it and gives insight. |
Finite obstruction sets for lower ideals in the minor order are guaranteed to exist by the Graph Minor Theorem. It has been known for several years that, in principle, obstruction sets can be mechanically computed for most natural lower ideals. |
A k-connected graph such that deleting any edge / deleting any vertex / contracting any edge results in a graph which is not k-connected is called minimally / critically / contraction-critically k-connected. These three classes play a prominent role in graph connectivity theory, and we give a brief introduction with a... |
The Foata bijection $\Phi : S_n \to S_n$ is extended to the bijections $\Psi : A_{n+1} \to A_{n+1}$ and $\Psi_q : S_{n+q-1} \to S_{n+q-1}$, where S_m, A_m are the symmetric and the alternating groups. These bijections imply bijective proofs for recent equidistribution theorems, by Regev and Roichman, for A_{n+1} and f... |
Let $S\subseteq \mathbb{N}$ be a numerical semigroup with multiplicity $m$, embedding dimension $\nu$ and conductor $c=f+1=qm-\rho$ for some $q,\rho\in\mathbb{N}$ with $\rho<m$. Let Ap$(S,m) = \{w\_0<w_1 < \ldots < w_{m-1}\}$ be the Apéry set of $S$. |
The Eulerian polynomials enumerate permutations according to their number of descents. We initiate the study of descent polynomials over Cayley permutations, which we call Caylerian polynomials. |
The exponential generating functions of {n^(n+m)} for arbitrary integer m are expressed as rational functions of the e.g.f. of {n^(n-1)} [the tree function] and then of the e.g.f. of {n^n} [the endofunction function]. <br>The coefficients in these rational functions include 2nd-order Eulerian numbers (a result of L. C... |
The Gale-Berlekamp switching game is played on the following device: <br>$G_n=\{1,2,\ldots,n\} \times \{1,2,\ldots,n\}$ <br>is an $n \times n$ array of lights is controlled by $2n$ switches, one for each row or column. <br>Given an (arbitrary) initial configuration of the board, the objective is to have as many lights... |
In this paper we consider the following three coloring concepts for digraphs. First of all, the generalized coloring concept, in which the same colored vertices of a digraph induce a subdigraph that satisfies a given digraph property. |
In this paper, the investigates Adriatic indices, specifically the sum lordeg index where it defined as $SL(G) = \sum_{u \in V(G)} °_G (u) \sqrt{\ln °_G |
We give an easy proof of Schützenberger's Theorem stating that non-commutative formal power series are rational if and only if they are recognisable. A byproduct of this proof is a natural metric on a subgroup of invertible rational non-commutative power series. |
A multipath in a directed graph is a disjoint union of paths. The multipath complex of a directed graph ${\tt G}$ is the simplicial complex whose faces are the multipaths of ${\tt G}$. |
In this paper we compute bounds for signless Laplacian energy, distance signless Laplacian eigenvalues and signless Laplacian energy of unitary addition Cayley graph G_{n}. We also obtain distance Laplacian eigenvalues and distance Laplacian energy of G_{n}. |
An interval graph is considered improper if and only if it has a representation such that an interval contains another interval. Previously these have been investigated in terms of balance and minimal forbidden interval subgraphs for the class of 1-improper interval graphs. |
Restricted star colouring is a variant of star colouring introduced to design heuristic algorithms to estimate sparse Hessian matrices. For $k\in\mathbb{N}$, a $k$-restricted star colouring ($k$-rs colouring) of a graph $G$ is a function $f:V(G)\to{0,1,\dots,k-1}$ such that |
Following Lucas and then other Fibonacci people Kwasniewski had introduced and had started ten years ago the open investigation of the overall F-nomial coefficients which encompass among others Binomial, Gaussian and Fibonomial coefficients with a new unified combinatorial interpretation expressed in terms of cobweb po... |
We introduce a high uniformity generalization of the so-called (projective) norm graphs of Alon, Kollár, Rónyai, and Szabó, and use it to show that $$\operatorname{ex}_{d}(n,K_{s_{1},\ldots,s_{d}}^{(d)}) = \Theta\left(n^{d - \frac{1}{s_{1}\ldots s_{d-1}}}\right)$$ holds for all integers $s_{1},\ldots,s_{d} \geq 2$ such... |
A mapping of $k$-bit strings into $n$-bit strings is called an $(\alpha,\beta)$-map if $k$-bit strings which are more than $\alpha k$ apart are mapped to $n$-bit strings that are more than $\beta n$ apart. This is a relaxation of the classical problem of constructing error-correcting codes, which corresponds to $\alph... |
We introduce a monomial ideal whose standard monomials encode the vertices of all fibers of a lattice. We study the minimal generators, the radical, the associated primes and the primary decomposition of this ideal, as well as its relation to initial ideals of lattice ideals. |
In the 1990s, Kita--Yoshida and Cho--Matsumoto introduced intersection forms on the twisted (co)homologies of hyperplane arrangement complements. We give a closed combinatorial formula for these intersection pairings. |
We give explicit constructions for incomplete pairwise balanced designs IPBD$((v;w),K)$, or, equivalently, edge-decompositions of a difference of two cliques $K_v \setminus K_w$ into cliques whose sizes belong to the set $K$. Our constructions produce such designs whenever $v$ and $w$ satisfy the usual divisibility co... |
Let $k$ be a positive integer and let $G$ be a graph with vertex set $V(G)$. A subset $D \subseteq V(G)$ is a $k$-dominating set if every vertex outside $D$ is adjacent to at least $k$ vertices in $D$. |
We investigate preference profiles for a set $\mathcal{V}$ of voters, where each voter $i$ has a preference order $\succ_i$ on a finite set $A$ of alternatives (that is, a linear order on $A$) such that for each two alternatives $a,b\in A$, voter $i$ prefers $a$ to $b$ if $a\succ_i b$. Such a profile is narcissistic i... |
We here construct an explicit isomorphism between any commutative Hopf algebra which underlying coalgebra is the tensor coalgebra of a space $V$ and the shuffle algebra based on the same space. This isomorphism uses the commutative $B_\infty$ structure that governs the product and the eulerian idempotent, as well as t... |
A graph G is r-Ramsey for a graph H, denoted by G\rightarrow (H)_r, if every r-colouring of the edges of G contains a monochromatic copy of H. The graph G is called r-Ramsey-minimal for H if it is r-Ramsey for H but no proper subgraph of G possesses this property. Let s_r(H) denote the smallest minimum degree of G ove... |
Given a graph $G$ and assuming that some vertices of $G$ are infected, the $r$-neighbor bootstrap percolation rule makes an uninfected vertex $v$ infected if $v$ has at least $r$ infected neighbors. The $r$-percolation number, $m(G, r)$, of $G$ is the minimum cardinality of a set of initially infected vertices in $G$ ... |
A hole in a graph is a chordless cycle of length at least 4. A theta is a graph formed by three paths between the same pair of distinct vertices so that the union of any two of the paths induces a hole. |
For $\textbf{r}=(r_1,\ldots,r_k)$, an $\textbf{r}$-factorization of the complete $\lambda$-fold $h$-uniform $n$-vertex hypergraph $\lambda K_n^h$ is a partition of the edges of $\lambda K_n^h$ into $F_1,\ldots, F_k$ such that $F_j$ is $r_j$-regular and spanning for $1\leq j\leq k$. This paper shows that for $n>\fra... |
It is easy to see that every $k$-edge-colouring of the complete graph on $2^k+1$ vertices contains a monochromatic odd cycle. In 1973, Erdős and Graham asked to estimate the smallest $L(k)$ such that every $k$-edge-colouring of $K_{2^k+1}$ contains a monochromatic odd cycle of length at most $L(k)$. |
We consider a logical puzzle which we call double pouring problem, which was original defined for $k=3$ vessels. We generalize this definition to $k \ge 2 $ as follows. |
We investigate the coefficients generated by expressing the falling factorial $(xy)_k$ as a linear combination of falling factorial products $ (x)_l |
We provide three infinite families of graphs in the Johnson and Grassmann schemes that are not uniquely determined by their spectrum. We do so by constructing graphs that are cospectral but non-isomorphic to these graphs. |
We give a new proof of the fact that the complement of the complexification of a real hyperplane arrangement is homotopy equivalent to the Salvetti complex of the associated oriented matroid. Our proof involves no choices, is relatively easy to visualize, and generalizes to the setting of conditional oriented matroids... |
Let $A_{s,k}(m)$ be the maximum number of distinct letters in any sequence which can be partitioned into $m$ contiguous blocks of pairwise distinct letters, has at least $k$ occurrences of every letter, and has no subsequence forming an alternation of length $s$. Nivasch (2010) proved that $A_{5, 2d+1}(m) = \theta( m ... |
For graphs $G$ and $H$, an $H$-coloring of $G$ is an adjacency preserving map from the vertices of $G$ to the vertices of $H$. $H$-colorings generalize such notions as independent sets and proper colorings in graphs. |
We study planar graphs with large negative curvature outside of a finite set and the spectral theory of Schr{ö}dinger operators on these graphs. We obtain estimates on the first and second order term of the eigenvalue asymptotics. |
Let $G$ be a graph. The {\em spectral radius} of $G$ is the largest eigenvalue of its adjacency matrix. |
We investigate the worst-case behavior of the simplex algorithm on linear programs with three variables, that is, on 3-dimensional simple polytopes. Among the pivot rules that we consider, the ``random edge'' rule yields the best asymptotic behavior as well as the most complicated analysis. |
As a generalization of matching preclusion number of a graph, we provide the (strong) integer $k$-matching preclusion number, abbreviated as $MP^{k}$ number ($SMP^{k}$ number), which is the minimum number of edges (vertices and edges) whose deletion results in a graph that has neither perfect integer $k$-matching nor a... |
We develop a classification of the fixed points and cycles of the Kaprekar transformation in even bases. The most numerous fixed points and cycles are those we denote symmetric and almost-symmetric; the structure of the cycles of these classes in base $b$ is determined by subgroups and cosets in the multiplicative gro... |
We explicitly describe the isomorphism between two combinatorial realizations of Kashiwara's infinity crystal in types B and C. The first realization is in terms of marginally large tableaux and the other is in terms of Kostant partitions coming from PBW bases. We also discuss a stack notation for Kostant partitio... |
Skew-symmetric non-integer matrices with real entries can be viewed as quivers with non-integer weights of arrows. One can mutate such quivers according to usual rules of quiver mutation. |
There are two properties shared by all known crossing-minimizing geometric drawings of $K_n$, for $n$ a multiple of 3. First, the underlying $n$-point set of these drawings has exactly $3\binom{k+2}{2}$ $(\le k)$-edges, for all $0\le k < n/3$. |
The unraveled ball of radius $r$ centered at a vertex $v$ in a weighted graph $G$ is the ball of radius $r$ centered at $v$ in the universal cover of $G$. We present a general bound on the maximum spectral radius of unraveled balls of fixed radius in a weighted graph. |
The extremal theory of forbidden 0-1 matrices studies the asymptotic growth of the function $\mathrm{Ex}(P,n)$, which is the maximum weight of a matrix $A\in\{0,1\}^{n\times n}$ whose submatrices avoid a fixed pattern $P\in\{0,1\}^{k\times l}$. This theory has been wildly successful at resolving problems in combinator... |
The q-binomial coefficients were assumed to be unimodal as early as the 1850's, but it remained unproven until Sylvester's 1878 proof using invariant theory. In 1982, Proctor gave an "elementary" proof using linear algebra. |
We introduce generalised orbit algebras. The purpose here is to measure how some combinatorial properties can characterize the action of a group of permutations on the subsets. |
We study some specializations and extensions of the quantum version of the MacMahon Master Theorem derived by Garoufalidis, Le and Zeilberger. In particular, we obtain a (t,q)-analogue for the Cartier-Foata noncommutative version and a semi-strong (t,q)-analogue for the contextual algebra. |
By tropical Abel-Jacobi theorem, the Jacobian of a tropical curve is isomorphic to the Picard group. A tropical curve in $\mathbb{R}^2$ corresponds to an immersion from a tropical curve to $\mathbb{R}^2$. |
In this paper, we construct two hypergraphs which exhibit the following properties. We first construct a hypergraph $G_{CP}$ and show that Breaker wins the Maker-Breaker game on $G_{CP}$, but Chooser wins the Chooser-Picker game on $G_{CP}$. |
The Ramsey numbers $R(T_n,W_8)$ are determined for each tree graph $T_n$ of order $n\geq 7$ and maximum degree $\Delta(T_n)$ equal to either $n-4$ or $n-5$. These numbers indicate strong support for the conjecture, due to Chen, Zhang and Zhang and to Hafidh and Baskoro, that $R(T_n,W_m) = 2n-1$ for each tree graph $T_... |
Let $\mathbb{S}_g$ be the orientable surface of genus $g$. We prove that the component structure of a graph chosen uniformly at random from the class $\mathcal{S}_g(n,m)$ of all graphs on vertex set $[n]=\{1,\dotsc,n\}$ with $m$ edges embeddable on $\mathbb{S}_g$ features two phase transitions. |
E. R. Lamken prove in [5] that there exists a partitioned balanced tournament design of side $n$, PBTD($n$), for $n$ a positive integer, $n \ge 5$, except possibly for $n \in \{9,11,15\}$. In this article, we show the existence of PBTD($n$) for $n \in \{9,11,15\}$. |
We introduce the families of solvable and nilpotent matroids, examining their realization spaces, closures, and associated matroid and circuit varieties. We establish sufficient conditions for both the realizability of these matroids and the irreducibility of their associated varieties. |
Let $H$ be a fixed graph. Denote $f(n,H)$ to be the maximum number of edges not contained in any monochromatic copy of $H$ in a 2-edge-coloring of the complete graph $K_n$, and $ex(n,H)$ to be the {\it Turán number} of $H$. |
The purpose of this note is to define a graph whose vertex set is a finite group $G$, whose edge set is contained in that of the commuting graph of $G$ and contains the enhanced power graph of $G$. We call this graph the deep commuting graph of $G$. |
In a previous paper, we derived necessary and sufficient conditions for the invertibility of square submatrices of the Pascal upper triangular matrix. To do so, we established a connection with the two-point Birkhoff interpolation problem. |
An old problem in discrete geometry, originating with Kupitz, asks whether there is a fixed natural number $k$ such that every finite set of points in the plane has a line through at least two of its points where the number of points on either side of this line differ by at most $k$. We give a negative answer to a nat... |
This paper presents an alternative proof of the celebrated friendship theorem, originally established by Erdős, Rényi, and Sós (1966). The proof relies on a closed-form expression for the Lovász $\vartheta$-function of strongly regular graphs, recently derived by the author. |
A classical result of Komlós, Sárközy and Szemerédi shows that every large $n$-vertex graph with minimum degree at least $(1/2+\gamma)n$ contains all spanning trees of bounded degree. We generalised this result to loose spanning hypertrees in $k$-uniform hypergraphs, that is, linear hypergraphs obtained by subsequentl... |
This paper introduces a new method for redefining the Roman factorial using universally applicable functions that are not expressed in closed form. We present a set of foundational functions, similar to Boolean operations, to simplify the factorial expression. |
We present several characterizations of circle graphs, which follow from Bouchet's circle graph obstructions theorem. |
We examine the topology of the clique complexes of the graphs of weakly and strongly separated subsets of the set $[n]=\{1,2,...,n\}$, which, after deleting all cone points, we denote by $\hat{\Delta}_{ws}(n)$ and $\hat{\Delta}_{ss}(n)$, respectively. In particular, we find that $\hat{\Delta}_{ws}(n)$ is contractible ... |
We give an explicit formula for the Hankel transform of a regular sequence in terms of the coefficients of the associated orthogonal polynomials and the sequence itself. We apply this formula to some sequences of combinatorial interest, deriving interesting combinatorial identities by this means. |
We analyze the covertime of a biased random walk on the random graph $G_{n,p}$. The walk is biased towards visiting vertices of low degree and this makes the covertime less than in the unbiased case |
The (n,k)-star graph is a very important computer modelling. The independent number and chromatic number of a graph are two important parameters in graph theory. |
In this paper we prove the Bannai-Ito conjecture, namely that there are only finitely many distance-regular graphs of fixed valency greater than two. |
We investigate the notion of almost avoiding a permutation: $\pi$ almost avoids $\beta$ if one can remove a single entry from $\pi$ to obtain a $\beta$-avoiding permutation. |
A {\em total coloring} of a graph $G$ is an assignment of colors to the vertices and the edges of $G$ such that every pair of adjacent/incident elements receive distinct colors. The {\em total chromatic number} of a graph $G$, denoted by $\chiup''(G)$, is the minimum number of colors in a total coloring of $G$... |
We prove that deciding whether the edge set of a graph can be partitionned into two spanning trees with orientation constraints is NP-complete. If P $\neq$ NP then this disproves a conjecture of Recski. |
Graph matrices are a type of matrix which has played a crucial role in analyzing the sum of squares hierarchy on average case problems. However, except for rough norm bounds, little is known about graph matrices. |
In this paper, we generalize the notion of functional graph. Specifically, given an equation $E(X,Y) = 0$ with variables $X$ and $Y$ over a finite field $\mathbb{F}_q$ of odd characteristic, we define a digraph by choosing the elements in $\mathbb{F}_q$ as vertices and drawing an edge from $x$ to $y$ if and only if $E... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.