scholarly journals The Gonality Sequence of Complete Graphs

10.37236/6876 ◽  
2017 ◽  
Vol 24 (4) ◽  
Author(s):  
Filip Cools ◽  
Marta Panizzut
Keyword(s):  
Linear Systems ◽  
Complete Graph ◽  
Algebraic Curve ◽  
Plane Curve ◽  
Finite Graph ◽  
Complete Graphs ◽  
Metric Graphs ◽  
Smooth Plane ◽  
Graph Metric ◽  
Gonality Sequence

The gonality sequence $(\gamma_r)_{r\geq1}$ of a finite graph/metric graph/algebraic curve comprises the minimal degrees $\gamma_r$ of linear systems of rank $r$. For the complete graph $K_d$, we show that $\gamma_r =  kd - h$ if $r<g=\frac{(d-1)(d-2)}{2}$, where $k$ and $h$ are the uniquely determined integers such that $r = \frac{k(k+3)}{2} - h$ with $1\leq k\leq d-3$ and $0 \leq h \leq k $. This shows that the graph $K_d$ has the gonality sequence of a smooth plane curve of degree $d$. The same result holds for the corresponding metric graphs.

scholarly journals A Family of Symmetric Graphs with Complete Quotients

10.37236/5701 ◽  
2016 ◽  
Vol 23 (2) ◽  
Author(s):  
Teng Fang ◽  
Xin Gui Fang ◽  
Binzhou Xia ◽  
Sanming Zhou
Keyword(s):  
Complete Graph ◽  
Incidence Structure ◽  
Finite Graph ◽  
Complete Classification ◽  
Complete Graphs ◽  
Quotient Graph ◽  
Point Set ◽  
Natural Incidence ◽  
Ordered Pairs

A finite graph $\Gamma$ is $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on $V(\Gamma)$ and transitively on the set of ordered pairs of adjacent vertices of $\Gamma$. If $V(\Gamma)$ admits a nontrivial $G$-invariant partition ${\cal B}$ such that for blocks $B, C \in {\cal B}$ adjacent in the quotient graph $\Gamma_{{\cal B}}$ relative to ${\cal B}$, exactly one vertex of $B$ has no neighbour in $C$, then we say that $\Gamma$ is an almost multicover of $\Gamma_{{\cal B}}$. In this case there arises a natural incidence structure ${\cal D}(\Gamma, {\cal B})$ with point set ${\cal B}$. If in addition $\Gamma_{{\cal B}}$ is a complete graph, then ${\cal D}(\Gamma, {\cal B})$ is a $(G, 2)$-point-transitive and $G$-block-transitive $2$-$(|{\cal B}|, m+1, \lambda)$ design for some $m \geq 1$, and moreover either $\lambda=1$ or $\lambda=m+1$. In this paper we classify such graphs in the case when $\lambda = m+1$; this together with earlier classifications when $\lambda = 1$ gives a complete classification of almost multicovers of complete graphs.

scholarly journals Higher rank Clifford indices of curves on a K3 surface

2021 ◽  
Vol 27 (3) ◽  
Author(s):  
Soheyla Feyzbakhsh ◽  
Chunyi Li
Keyword(s):  
Vector Bundles ◽  
Plane Curve ◽  
Smooth Curve ◽  
Line Bundles ◽  
K3 Surface ◽  
Clifford Index ◽  
Smooth Plane ◽  
Higher Rank ◽  
Rank Vector ◽  
Semistable Vector Bundle

AbstractLet (X, H) be a polarized K3 surface with $$\mathrm {Pic}(X) = \mathbb {Z}H$$ Pic ( X ) = Z H , and let $$C\in |H|$$ C ∈ | H | be a smooth curve of genus g. We give an upper bound on the dimension of global sections of a semistable vector bundle on C. This allows us to compute the higher rank Clifford indices of C with high genus. In particular, when $$g\ge r^2\ge 4$$ g ≥ r 2 ≥ 4 , the rank r Clifford index of C can be computed by the restriction of Lazarsfeld–Mukai bundles on X corresponding to line bundles on the curve C. This is a generalization of the result by Green and Lazarsfeld for curves on K3 surfaces to higher rank vector bundles. We also apply the same method to the projective plane and show that the rank r Clifford index of a degree $$d(\ge 5)$$ d ( ≥ 5 ) smooth plane curve is $$d-4$$ d - 4 , which is the same as the Clifford index of the curve.

Minimal Decompositions of Complete Graphs into Subgraphs with Embeddability Properties

1969 ◽  
Vol 21 ◽  
pp. 992-1000 ◽  
Author(s):  
L. W. Beineke
Keyword(s):  
Projective Plane ◽  
Complete Graph ◽  
Planar Graphs ◽  
Complete Graphs ◽  
Minimum Number ◽  
Double Torus

Although the problem of finding the minimum number of planar graphs into which the complete graph can be decomposed remains partially unsolved, the corresponding problem can be solved for certain other surfaces. For three, the torus, the double-torus, and the projective plane, a single proof will be given to provide the solutions. The same questions will also be answered for bicomplete graphs.

scholarly journals INTRINSICALLY LINKED GRAPHS WITH KNOTTED COMPONENTS

2012 ◽  
Vol 21 (07) ◽  
pp. 1250065 ◽  
Author(s):  
THOMAS FLEMING
Keyword(s):  
Complete Graph ◽  
Cartesian Product ◽  
Complete Graphs ◽  
Linking Number ◽  
A Minor

We construct a graph G such that any embedding of G into R3 contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H contains a nonsplit n component link, where at least m of the components are nontrivial knots. We then turn our attention to complete graphs and show that for any given n, every embedding of a large enough complete graph contains a 2-component link whose linking number is a nonzero multiple of n. Finally, we show that if a graph is a Cartesian product of the form G × K2, it is intrinsically linked if and only if G contains one of K5, K3,3 or K4,2 as a minor.

Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP

1996 ◽  
Vol 5 (3) ◽  
pp. 297-306 ◽  
Author(s):  
Rachid Saad
Keyword(s):  
Complete Graph ◽  
Strong Evidence ◽  
General Setting ◽  
Maximum Length ◽  
Sufficient Condition ◽  
Complete Graphs ◽  
Random Polynomial ◽  
Exact Matching ◽  
Matching Problem ◽  
Bipartite Tournament

Jackson [10] gave a polynomial sufficient condition for a bipartite tournament to contain a cycle of a given length. The question arises as to whether deciding on the maximum length of a cycle in a bipartite tournament is polynomial. The problem was considered by Manoussakis [12] in the slightly more general setting of 2-edge coloured complete graphs: is it polynomial to find a longest alternating cycle in such coloured graphs? In this paper, strong evidence is given that such an algorithm exists. In fact, using a reduction to the well known exact matching problem, we prove that the problem is random polynomial.

scholarly journals A metric graph satisfying w41=1$w_4^1 = 1$ that cannot be lifted to a curve satisfying dim⁡ (W41)=1$\dim \;(W_4^1 ) = 1$

2016 ◽  
Vol 14 (1) ◽  
pp. 1-12 ◽  
Author(s):  
Marc Coppens
Keyword(s):  
Linear Systems ◽  
Harmonic Morphism ◽  
Metric Graphs ◽  
Clifford Index ◽  
Special Linear ◽  
Metric Graph ◽  
Index 2

AbstractFor all integers g ≥ 6 we prove the existence of a metric graph G with $w_4^1 = 1$ such that G has Clifford index 2 and there is no tropical modification G′ of G such that there exists a finite harmonic morphism of degree 2 from G′ to a metric graph of genus 1. Those examples show that not all dimension theorems on the space classifying special linear systems for curves have immediate translation to the theory of divisors on metric graphs.

scholarly journals Isomorphic subgraphs having minimal intersections

1983 ◽  
Vol 35 (3) ◽  
pp. 287-306
Author(s):  
R. C. Mullin ◽  
B. K. Roy ◽  
P. J. Schellenberg
Keyword(s):  
Complete Graph ◽  
Upper Bound ◽  
Packing Problem ◽  
Finite Graph ◽  
Combinatorial Problems ◽  
Set Packing ◽  
Complete Subgraph ◽  
Special Cases ◽  
Set Packing Problem ◽  
Special Classes

AbstractGiven a finite graph H and G, a subgraph of it, we define σ (G, H) to be the largest integer such that every pair of subgraphs of H, both isomorphic to G, has at least σ(G, H) edges in common; furthermore, R(G, H) is defined to be the maximum number of subgraphs of H, all isomorphic to G, such that any two of them have σ(G, H) edges common between them. We are interested in the values of σ(G, H) and R(G, H) for general H and G. A number of combinatorial problems can be considered as special cases of this question; for example, the classical set-packing problem is equivalent to evaluating R (G, H) where G is a complete subgraph of the complete graph H and σ(G, H) = 0, and the decomposition of H into subgraphs isomorphic to G is equivalent to showing that σ(G, H) = 0 and R(G, H) = ε(H)/ε(G) where ε(H), ε(G) are the number of edges in H, G respectively.A result of S. M. Johnson (1962) gives an upper bound for R(G, H) in terms of σ(G, H). As a corollary of Johnson's result, we obtain the upper bound of McCarthy and van Rees (1977) for the Cordes problem. The remainder of the paper is a study of σ (G, H) and R(G, H) for special classes of graphs; in particular, H is a complete graph and G is, in most instances, a union of disjoint complete subgraphs.

scholarly journals Components of the Hilbert scheme of space curves on low-degree smooth surfaces

2015 ◽  
Vol 26 (02) ◽  
pp. 1550017 ◽  
Author(s):  
Jan O. Kleppe ◽  
John C. Ottem
Keyword(s):  
Hilbert Scheme ◽  
Smooth Surface ◽  
Plane Curve ◽  
Picard Number ◽  
Connected Space ◽  
Space Curves ◽  
Cubic Surfaces ◽  
Smooth Component ◽  
Low Degree ◽  
Smooth Plane

We study maximal families W of the Hilbert scheme, H(d, g)sc, of smooth connected space curves whose general curve C lies on a smooth surface S of degree s. We give conditions on C under which W is a generically smooth component of H(d, g)sc and we determine dim W. If s = 4 and W is an irreducible component of H(d, g)sc, then the Picard number of S is at most 2 and we explicitly describe, also for s ≥ 5, non-reduced and generically smooth components in the case Pic (S) is generated by the classes of a line and a smooth plane curve of degree s - 1. For curves on smooth cubic surfaces the first author finds new classes of non-reduced components of H(d, g)sc, thus making progress in proving a conjecture for such families.

scholarly journals Perfect One-Factorization Conjecture

d'CARTESIAN ◽  
2015 ◽  
Vol 4 (1) ◽  
pp. 114
Author(s):  
Chriestie Montolalu
Keyword(s):  
Complete Graph ◽  
Complete Graphs

Perfect one-factorization of the complete graph K2n for all n greater and equal to 2 is conjectured. Nevertheless some families of complete graphs were found to have perfect one-factorization. This paper will show some of the perfect one-factorization results in some families of complete graph as well as some result in application. Keywords: complete graph, one-factorization

Sign in / Sign up

Export Citation Format

Share Document