Result: Trees are almost prime
Title:
Trees are almost prime
Authors:
Source:
The Fourth Cracow Conference on Graph Theory Czorsztyn 2002Discrete mathematics. 307(11-12):1455-1462
Publisher Information:
Amsterdam: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 6 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Théorie des graphes, Graph theory, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Recherche information. Graphe, Information retrieval. Graph, Ordre n, N order, Orden n, Sous graphe, Subgraph, Subgrafo, 05C05, 68R10, Arbre ordonné, Entringer's conjecture, Prime graphs, Trees
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213, United States
ISSN:
0012-365X
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Mathematics
Mathematics
Accession Number:
edscal.18660657
Database:
PASCAL Archive
Further Information
Let Sn denote the graph on {1,..., n} in which two numbers are adjacent if and only if they are coprime. Around 1980 Entringer conjectured that Sn contains every tree of order n as a subgraph. Here we show that this conjecture is true for all n ≤ 50. Further positive evidence is provided by our main result that Sn contains every tree of order (1 - o(1))n.