|
|
| Line 1: |
Line 1: |
| In [[graph theory]], '''Turán's theorem''' is a result on the number of edges in a [[complete graph|''K''<sub>''r''+1</sub>]]-[[Glossary_of_graph_theory#Subgraphs|free]] [[Graph (mathematics)|graph]].
| | == right Jordan Basketball Shoes Australia == |
|
| |
|
| An ''n''-[[vertex (graph theory)|vertex]] graph that does not contain any (''r'' + 1)-vertex [[clique (graph theory)|clique]] may be formed by partitioning the set of vertices into ''r'' parts of equal or nearly equal size, and connecting two vertices by an edge whenever they belong to two different parts. We call the resulting graph the [[Turán graph]] ''T''(''n'',''r''). Turán's theorem states that the Turán graph has the largest number of edges among all ''K''<sub>''r''+1</sub>-free ''n''-vertex graphs.
| | Depo provera pregnancy symptoms ? . I have been having several the signs of pregnancy lately, however Im beginning to get confused. I just recently stopped take. Pediatric growth charts could be a valuable tool to parents. It can benefit you know where you child is as far as physical growth goes. Its not all child grows the same, so taking into account your families tendencies towards weight and height must be considered. <br><br>CSS's biggest success would be a case of insider trading of the public company employee who was feeding sensitive information concerning an impending suit and eventual buyout with a larger competitor to a group of shady Shanghai investors. For the information the worker received 5,000 rmb each month. The young man was nabbed by CSS prior to the stock play took place and three shady Shanghai investors fled China to prevent prosecution. <br><br>(All kids are into that, right?) Generally people know it's hard for moms to get to the computer. But smartphones are not any easier. We'd love to reach that email or voicemail [http://www.maryboroughbridgeclub.com/documents/brifiles.asp?id=49-Jordan-Basketball-Shoes-Australia Jordan Basketball Shoes Australia] or text. The shop has over 300 sunglasses displayed. Normally, all sunglasses are $50 and under, but from Friday to Sunday, PSP will cut yet another 25% off almost everything in the store, excluding perfumes. PSP offers brands such as XLoop, Biohazard, Locs, Snooki, DG and Hello Kitty. <br><br>Some experts speculate that youngsters may regress before learning a brand new skill to give their brain a rest before making a big leap forward. If you notice your child stutters more when she's tired, excited, or upset. I mostly get grunts and whines from her right now and points. <br><br>Of course, I find out about it the day before the deadline, so my pimpage may be worth squat, but woonelly. That is SOME contest.A graceful curtsey to Qadesh [http://www.maryboroughbridgeclub.com/documents/brifiles.asp?id=137-Air-Jordan-6 Air Jordan 6] for the info.I don mind the rules, but I can participate. And Simon Schuster still hasn come completely clean about the ForeverRites issues.Najida, it has to be [http://www.drlindycrocker.com/AWStats/header.asp?n=164-New-Balance-Store-Au New Balance Store Au] the whole MS. <br><br>Based on WPRI, Ruggiero can expect to bring home between $60$100 in tips per night. Like most waitresses, Ruggiero's income relies heavily on tips. She earns $2.89 each hour in salary, which is well below Rhode Island's minimum wage of $7.40. <br><br>Try Skelion is a website dedicated to alternative religions in general. More specifically, ancient and forgotten religions would be the focal point. Considered to be the perfect library for ancient religion, Try Skelion has a tremendous amount of information regarding moon rituals. <br><br>The 53yearold suffers from herniated disks in his lumbar spine that impinge on his nerves. Surgery will decrease the [http://www.jrhc.com.au/js/style.asp?u=61-Ugg-Boots-For-Sale-Melbourne Ugg Boots For Sale Melbourne] pain, but that would also put him out of commission. And right now, Dicky Eklund can't be out of commission. If you happen to take a product that is already available and wish to bring in a different audience then you will have to change the message to draw in the correct crowd. Younger people might be far more comfortable shopping online than seniors. Targeting older people you would have to get into print media rather than online resources..<ul> |
| | | |
| [[Turán graph]]s were first described and studied by [[Hungary|Hungarian]] [[mathematician]] [[Paul Turán]] in 1941, though a special case of the theorem was stated earlier by Mantel in 1907.
| | <li>[http://israeliz.net/activity/p/40215/ http://israeliz.net/activity/p/40215/]</li> |
| | | |
| ==Formal statement==
| | <li>[http://166.111.7.59/luo/forum.php?mod=viewthread&tid=2617191&extra= http://166.111.7.59/luo/forum.php?mod=viewthread&tid=2617191&extra=]</li> |
| Formally, Turán's theorem may be stated as follows.
| | |
| | | <li>[http://forum.tlmacau.com/viewthread.php?tid=224125&extra=page%3D1&frombbs=1 http://forum.tlmacau.com/viewthread.php?tid=224125&extra=page%3D1&frombbs=1]</li> |
| Let ''G'' be any graph with ''n'' vertices, such that ''G'' is ''K''<sub>''r''+1</sub> -free. Then the number of edges in ''G'' is at most
| | |
| | | <li>[http://huanxun9999.com/news/html/?70188.html http://huanxun9999.com/news/html/?70188.html]</li> |
| :<math>\frac{r-1}{r}\cdot\frac{n^2}{2} = \left( 1-\frac{1}{r} \right) \cdot\frac{n^2}{2}.</math>
| | |
| | | </ul> |
| An equivalent formulation is the following:
| |
| | |
| Among the ''n''-vertex simple graphs with no (''r'' + 1)-cliques, ''T''(''n'',''r'') has the maximum number of edges.
| |
| | |
| ==Proof==
| |
| | |
| Let <math>G</math> be an ''n''-vertex simple graph with no (''r'' + 1)-clique and with the maximum number of edges.
| |
| | |
| :'''Overview:''' The proof consists of two claims about <math>G</math>, which we outline, before proving.
| |
| The first claim is that <math>G</math> must be a complete r-partite graph (although it's stated more technically below). In other words, we can partition the vertex set into <math>r</math> subsets <math>S_1, S_2,\ldots,S_r</math> such that if two vertices are in different sets, <math>S_i</math> and <math>S_j</math>, then they have an edge between them, but if they are in the same set, then they have no edge between them. The second claim is that the sizes of these sets <math>S_i</math> differ from each other by at most 1. For example, if we want the graph on 23 vertices with the most edges that does not contain a triangle, then we partition the vertices into sets <math>S_1</math> and <math>S_2</math>, with <math>|S_1|=12</math> and <math>|S_2|=11</math>. We add all the edges between the two sets, so the graph will have 11*12 = 132 edges. This matches with the theorem, which says that G will have at most <math>\frac{1}{2}\frac{23^2}{2} = \frac{23^2}4 = 132.25</math> edges.
| |
| | |
| :'''Claim 1:''' Graph <math>G</math> does not contain any three vertices <math>u,v,w</math> such that <math>G</math> contains edge <math>uv</math>, but contains neither edge <math>uw</math> nor <math>vw</math>. | |
| (This claim is equivalent to the relation x~y iff x not connected to y
| |
| being an equivalence relation. ~ is always
| |
| reflexive and symmetric, but only in special cases is it transitive. ~ is not transitive precisely when we have ''u'', ''v'' and ''w'' with ''u'' ~ ''w'' and ''w'' ~ ''v'' without ''u'' ~ ''v''.)
| |
| | |
| Assume the claim is false. Construct a new ''n''-vertex simple graph <math>G'</math> that contains no (''r'' + 1)-clique but has more edges than <math>G</math>, as follows:
| |
| | |
| Case 1: <math>d(w) < d(u)\text{ or }d(w) < d(v).</math>
| |
| | |
| Assume that <math>d(w) < d(u)</math>. Delete vertex <math>w</math> and create a copy of vertex <math>u</math> (with all of the same neighbors as <math>u</math>); call it <math>u'</math>.
| |
| Any clique in the new graph contains at most one vertex among <math>\{u,u'\}</math>.
| |
| So this new graph does not contain any (''r'' + 1)-clique. However, it contains more edges: <math>|E(G')| = |E(G)| - d(w) + d(u) > |E(G)|.</math>
| |
| | |
| Case 2: <math>d(w)\geq d(u)</math> and <math>d(w)\geq d(v)</math>
| |
| | |
| Delete vertices <math>u</math> and <math>v</math> and create two new copies of vertex <math>w</math>.
| |
| Again, the new graph does not contain any (''r'' + 1)-clique. However it contains more edges: <math>|E(G')| = |E(G)| -(d(u) + d(v) - 1) + 2d(w) \geq |E(G)| + 1</math>.
| |
| | |
| This proves Claim 1.
| |
| | |
| The claim proves that one can partition the vertices of <math>G</math> into [[equivalence classes]] based on their nonneighbors; i.e. two vertices are in the same equivalence class if they are nonadjacent. This implies that <math>G</math> | |
| is a complete multipartite graph (where the parts are the equivalence classes).
| |
| | |
| :'''Claim 2:''' The number of edges in a complete ''k''-partite graph is maximized when the size of the parts differs by at most one.
| |
| | |
| If ''G'' is a complete ''k''-partite graph with parts ''A'' and ''B'' and <math>|A| > |B|+1</math>, then we can increase the number of edges in ''G'' by moving a vertex from part ''A'' to part ''B.'' By moving a vertex from part ''A'' to part ''B'', | |
| the graph loses <math>|B|</math> edges, but gains <math>|A|-1</math> edges. Thus, it gains at least <math>|A|-1-|B|\geq 1</math> edge. | |
| This proves Claim 2.
| |
| | |
| This proof shows that the Turan graph has the maximum number of edges.
| |
| Additionally, the proof shows that the Turan graph is the ''only'' graph that has the maximum number of edges.
| |
| | |
| ==Mantel's theorem==
| |
| As a special case of Turán's theorem, for ''r'' = 2, one obtains '''Mantel's theorem''':
| |
| | |
| The maximum number of edges in an ''n''-vertex [[triangle-free graph]] is <math>\lfloor n^2/4 \rfloor.</math>
| |
| | |
| In other words, one must delete nearly half of the edges in ''K''<sub>''n''</sub> to obtain a triangle-free graph.
| |
| | |
| A strengthened form of Mantel's theorem states that any hamiltonian graph with at least ''n''<sup>2</sup>/4 edges must either be the [[complete bipartite graph]] ''K''<sub>''n''/2,''n''/2</sub> or it must be [[pancyclic graph|pancyclic]]: not only does it contain a triangle, it must also contain cycles of all other possible lengths up to the number of vertices in the graph {{harv|Bondy|1971}}.
| |
| | |
| Another strengthening of Mantel's theorem states that the edges of every ''n''-vertex graph may be covered by at most <math>\lfloor n^2/4 \rfloor</math> [[clique (graph theory)|cliques]]: that is, the [[Intersection number (graph theory)|intersection number]] is at most <math>\lfloor n^2/4 \rfloor</math> {{harv|Erdős|Goodman|Pósa|1966}}.
| |
| | |
| == See also ==
| |
| * [[Extremal graph theory]]
| |
| * [[Erdős–Stone theorem]]
| |
| * [[Method_of_conditional_probabilities#Turán's_theorem|A probabilistic proof of Turán's theorem]]
| |
| * [[Turán's method]] in analytic number theory
| |
| | |
| ==References==
| |
| *{{Citation | last1=Aigner | first1=Martin | last2=Ziegler | first2=Günter M. | authorlink2=Günter M. Ziegler | title=[[Proofs from THE BOOK]] | publisher=[[Springer-Verlag]] | location=Berlin, New York | year=1998}}.
| |
| *{{citation
| |
| | last = Bondy | first = J. A. | authorlink = John Adrian Bondy
| |
| | doi = 10.1016/0095-8956(71)90016-5
| |
| | issue = 1
| |
| | journal = [[Journal of Combinatorial Theory]], Series B
| |
| | pages = 80–84
| |
| | title = Pancyclic graphs I
| |
| | volume = 11
| |
| | year = 1971}}.
| |
| *{{citation
| |
| | last1 = Erdős | first1 = Paul | authorlink1 = Paul Erdős
| |
| | last2 = Goodman | first2 = A. W. | last3 = Pósa | first3 = Louis | authorlink3=Lajos Pósa (mathematician)
| |
| | title = The representation of a graph by set intersections
| |
| | url = http://www.renyi.hu/~p_erdos/1966-21.pdf
| |
| | journal = Canadian Journal of Mathematics
| |
| | volume = 18 | issue = 1 | year = 1966 | pages = 106–112
| |
| | id = {{MathSciNet | id=0186575}}
| |
| | doi = 10.4153/CJM-1966-014-3}}.
| |
| * {{Citation
| |
| | last = Turán
| |
| | first = Paul
| |
| | year = 1941
| |
| | title = On an extremal problem in graph theory
| |
| | journal = Matematikai és Fizikai Lapok
| |
| | volume = 48
| |
| | pages = 436–452
| |
| | language = Hungarian
| |
| | postscript = .
| |
| }}
| |
| *{{Citation | last1=West | first1=Douglas Brent | title=Introduction to Graph Theory | origyear=1996 | publisher=[[Prentice Hall]] | edition=2nd | isbn=978-0-13-014400-3 | year=1999}}.
| |
| | |
| {{DEFAULTSORT:Turans theorem}}
| |
| [[Category:Extremal graph theory]]
| |
| [[Category:Theorems in graph theory]]
| |
| [[Category:Articles containing proofs]]
| |
right Jordan Basketball Shoes Australia
Depo provera pregnancy symptoms ? . I have been having several the signs of pregnancy lately, however Im beginning to get confused. I just recently stopped take. Pediatric growth charts could be a valuable tool to parents. It can benefit you know where you child is as far as physical growth goes. Its not all child grows the same, so taking into account your families tendencies towards weight and height must be considered.
CSS's biggest success would be a case of insider trading of the public company employee who was feeding sensitive information concerning an impending suit and eventual buyout with a larger competitor to a group of shady Shanghai investors. For the information the worker received 5,000 rmb each month. The young man was nabbed by CSS prior to the stock play took place and three shady Shanghai investors fled China to prevent prosecution.
(All kids are into that, right?) Generally people know it's hard for moms to get to the computer. But smartphones are not any easier. We'd love to reach that email or voicemail Jordan Basketball Shoes Australia or text. The shop has over 300 sunglasses displayed. Normally, all sunglasses are $50 and under, but from Friday to Sunday, PSP will cut yet another 25% off almost everything in the store, excluding perfumes. PSP offers brands such as XLoop, Biohazard, Locs, Snooki, DG and Hello Kitty.
Some experts speculate that youngsters may regress before learning a brand new skill to give their brain a rest before making a big leap forward. If you notice your child stutters more when she's tired, excited, or upset. I mostly get grunts and whines from her right now and points.
Of course, I find out about it the day before the deadline, so my pimpage may be worth squat, but woonelly. That is SOME contest.A graceful curtsey to Qadesh Air Jordan 6 for the info.I don mind the rules, but I can participate. And Simon Schuster still hasn come completely clean about the ForeverRites issues.Najida, it has to be New Balance Store Au the whole MS.
Based on WPRI, Ruggiero can expect to bring home between $60$100 in tips per night. Like most waitresses, Ruggiero's income relies heavily on tips. She earns $2.89 each hour in salary, which is well below Rhode Island's minimum wage of $7.40.
Try Skelion is a website dedicated to alternative religions in general. More specifically, ancient and forgotten religions would be the focal point. Considered to be the perfect library for ancient religion, Try Skelion has a tremendous amount of information regarding moon rituals.
The 53yearold suffers from herniated disks in his lumbar spine that impinge on his nerves. Surgery will decrease the Ugg Boots For Sale Melbourne pain, but that would also put him out of commission. And right now, Dicky Eklund can't be out of commission. If you happen to take a product that is already available and wish to bring in a different audience then you will have to change the message to draw in the correct crowd. Younger people might be far more comfortable shopping online than seniors. Targeting older people you would have to get into print media rather than online resources..