257 research outputs found
Sylvester: Ushering in the Modern Era of Research on Odd Perfect Numbers
In 1888, James Joseph Sylvester (1814-1897) published a series of papers that he hoped would pave the way for a general proof of the nonexistence of an odd perfect number (OPN). Seemingly unaware that more than fifty years earlier Benjamin Peirce had proved that an odd perfect number must have at least four distinct prime divisors, Sylvester began his fundamental assault on the problem by establishing the same result. Later that same year, he strengthened his conclusion to five. These findings would help to mark the beginning of the modern era of research on odd perfect numbers. Sylvester\u27s bound stood as the best demonstrated until Gradstein improved it by one in 1925. Today, we know that the number of distinct prime divisors that an odd perfect number can have is at least eight. This was demonstrated by Chein in 1979 in his doctoral thesis. However, he published nothing of it. A complete proof consisting of almost 200 manuscript pages was given independently by Hagis. An outline of it appeared in 1980.
What motivated Sylvester\u27s sudden interest in odd perfect numbers? Moreover, we also ask what prompted this mathematician who was primarily noted for his work in algebra to periodically direct his attention to famous unsolved problems in number theory? The objective of this paper is to formulate a response to these questions, as well as to substantiate the assertion that much of the modern work done on the subject of odd perfect numbers has as it roots, the series of papers produced by Sylvester in 1888
Covering line graphs with equivalence relations
An equivalence graph is a disjoint union of cliques, and the equivalence
number of a graph is the minimum number of equivalence
subgraphs needed to cover the edges of . We consider the equivalence number
of a line graph, giving improved upper and lower bounds: . This disproves a
recent conjecture that is at most three for triangle-free
; indeed it can be arbitrarily large.
To bound we bound the closely-related invariant
, which is the minimum number of orientations of such that for
any two edges incident to some vertex , both and are oriented
out of in some orientation. When is triangle-free,
. We prove that even when is triangle-free, it
is NP-complete to decide whether or not .Comment: 10 pages, submitted in July 200
On cycle packings and feedback vertex sets
For a graph , let and denote the minimum size of a feedback vertex set in and the maximum size of a cycle packing in , respectively. Kloks, Lee, and Liu conjectured that if is planar. They proved a weaker inequality, replacing by . We improve this, replacing by , and verifying the resulting inequality for graphs embedded in surfaces of nonnegative Euler characteristic. We also generalize to arbitrary surfaces. We show that, if a graph embeds in a surface of Euler characteristic , then . Lastly, we consider what the best possible bound on might be, and give some open problems
Partitions of graphs into cographs
AbstractCographs form the minimal family of graphs containing K1 that is closed with respect to complementation and disjoint union. We discuss vertex partitions of graphs into the smallest number of cographs. We introduce a new parameter, calling the minimum order of such a partition the c-chromatic number of the graph. We begin by axiomatizing several well-known graphical parameters as motivation for this function. We present several bounds on c-chromatic number in terms of well-known expressions. We show that if a graph is triangle-free, then its chromatic number is bounded between the c-chromatic number and twice this number. We show that both bounds are sharp for graphs with arbitrarily high girth. This provides an alternative proof to a result by Broere and Mynhardt; namely, there exist triangle-free graphs with arbitrarily large c-chromatic numbers. We show that any planar graph with girth at least 11 has a c-chromatic number at most two. We close with several remarks on computational complexity. In particular, we show that computing the c-chromatic number is NP-complete for planar graphs
Even and odd pairs in comparability and in P4-comparability graphs
AbstractWe characterize even and odd pairs in comparability and in P4-comparability graphs. The characterizations lead to simple algorithms for deciding whether a given pair of vertices forms an even or odd pair in these classes of graphs. The complexities of the proposed algorithms are O(n + m) for comparability graphs and O(n2m) for P4-comparability graphs. The former represents an improvement over a recent algorithm of complexity O(nm)
On Graphs with Proper Connection Number 2
An edge-colored graph is properly connected if for every pair of vertices u and v there exists a properly colored uv-path (i.e. a uv-path in which no two consecutive edges have the same color). The proper connection number of a connected graph G, denoted pc(G), is the smallest number of colors needed to color the edges of G such that the resulting colored graph is properly connected. An edge-colored graph is flexibly connected if for every pair of vertices u and v there exist two properly colored paths between them, say P and Q, such that the first edges of P and Q have different colors and the last edges of P and Q have different colors. The flexible connection number of a connected graph G, denoted fpc(G), is the smallest number of colors needed to color the edges of G such that the resulting colored graph is flexibly connected. In this paper, we demonstrate several methods for constructing graphs with pc(G) = 2 and fpc(G) = 2. We describe several families of graphs such that pc(G) ≥ 2 and we settle a conjecture from [BFG+12]. We prove that if G is connected and bipartite, then pc(G) = 2 is equivalent to being 2-edge-connected and fpc(G) = 2 is equivalent to the existence of a path through all cut-edges. Finally, it is proved that every connected, k-regular, Class 1 graph has flexible connection number 2
- …