1,640 research outputs found

    Extensions of Fractional Precolorings show Discontinuous Behavior

    Get PDF
    We study the following problem: given a real number k and integer d, what is the smallest epsilon such that any fractional (k+epsilon)-precoloring of vertices at pairwise distances at least d of a fractionally k-colorable graph can be extended to a fractional (k+epsilon)-coloring of the whole graph? The exact values of epsilon were known for k=2 and k\ge3 and any d. We determine the exact values of epsilon for k \in (2,3) if d=4, and k \in [2.5,3) if d=6, and give upper bounds for k \in (2,3) if d=5,7, and k \in (2,2.5) if d=6. Surprisingly, epsilon viewed as a function of k is discontinuous for all those values of d

    Combinatorics and geometry of finite and infinite squaregraphs

    Full text link
    Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not incident with the outer face) have degrees larger than three. The planar dual of a finite squaregraph is determined by a triangle-free chord diagram of the unit disk, which could alternatively be viewed as a triangle-free line arrangement in the hyperbolic plane. This representation carries over to infinite plane graphs with finite vertex degrees in which the balls are finite squaregraphs. Algebraically, finite squaregraphs are median graphs for which the duals are finite circular split systems. Hence squaregraphs are at the crosspoint of two dualities, an algebraic and a geometric one, and thus lend themselves to several combinatorial interpretations and structural characterizations. With these and the 5-colorability theorem for circle graphs at hand, we prove that every squaregraph can be isometrically embedded into the Cartesian product of five trees. This embedding result can also be extended to the infinite case without reference to an embedding in the plane and without any cardinality restriction when formulated for median graphs free of cubes and further finite obstructions. Further, we exhibit a class of squaregraphs that can be embedded into the product of three trees and we characterize those squaregraphs that are embeddable into the product of just two trees. Finally, finite squaregraphs enjoy a number of algorithmic features that do not extend to arbitrary median graphs. For instance, we show that median-generating sets of finite squaregraphs can be computed in polynomial time, whereas, not unexpectedly, the corresponding problem for median graphs turns out to be NP-hard.Comment: 46 pages, 14 figure

    The history of degenerate (bipartite) extremal graph problems

    Full text link
    This paper is a survey on Extremal Graph Theory, primarily focusing on the case when one of the excluded graphs is bipartite. On one hand we give an introduction to this field and also describe many important results, methods, problems, and constructions.Comment: 97 pages, 11 figures, many problems. This is the preliminary version of our survey presented in Erdos 100. In this version 2 only a citation was complete

    Prime and polynomial distances in colourings of the plane

    Full text link
    We give two extensions of the recent theorem of the first author that the odd distance graph has unbounded chromatic number. The first is that for any non-constant polynomial ff with integer coefficients and positive leading coefficient, every finite colouring of the plane contains a monochromatic pair of distinct points whose distance is equal to f(n)f(n) for some integer nn. The second is that for every finite colouring of the plane, there is a monochromatic pair of points whose distance is a prime number.Comment: 22 page

    On the independence ratio of distance graphs

    Full text link
    A distance graph is an undirected graph on the integers where two integers are adjacent if their difference is in a prescribed distance set. The independence ratio of a distance graph GG is the maximum density of an independent set in GG. Lih, Liu, and Zhu [Star extremal circulant graphs, SIAM J. Discrete Math. 12 (1999) 491--499] showed that the independence ratio is equal to the inverse of the fractional chromatic number, thus relating the concept to the well studied question of finding the chromatic number of distance graphs. We prove that the independence ratio of a distance graph is achieved by a periodic set, and we present a framework for discharging arguments to demonstrate upper bounds on the independence ratio. With these tools, we determine the exact independence ratio for several infinite families of distance sets of size three, determine asymptotic values for others, and present several conjectures.Comment: 39 pages, 12 figures, 6 table

    Sphere Packings in Euclidean Space with Forbidden Distances

    Full text link
    In this paper, we study the sphere packing problem in Euclidean space, where we impose additional constraints on the separations of the center points. We prove that any sphere packing in dimension 4848, with spheres of radii rr, such that \emph{no} two centers x1x_1 and x2x_2 satisfy 43<12rx1x2<53\sqrt{\tfrac{4}{3}} < \frac{1}{2r}|x_1-x_2| <\sqrt{\tfrac{5}{3}}, has density less or equal than (3π/2)24/24!( 3\pi /2)^{24}/24!. Equality occurs if and only if the packing is given by a 4848-dimensional even unimodular extremal lattice. This shows that any of the lattices P48p,P48q,P48mP_{48p},P_{48q},P_{48m} and P48nP_{48n} are optimal for this constrained packing problem. We also give results for packings up to dimension d1200d\leq 1200, where we impose constraints on the distance between centers and on the minimal norm of the spectrum, and show that even unimodular extremal lattices are again uniquely optimal. Moreover, in the 11-dimensional case, we give a condition on the set of constraints that allow the existence of an optimal periodic packing, and we develop an algorithm to find them by relating the problem to a question about linear domino tilings.Comment: 39 page
    corecore