Knowledge

Turán number

Source 📝

287: 191: 468: 552: 557: 488: 483: 390: 497: 517:
Turán, P (1941), "Egy gráfelméleti szélsőértékfeladatról (Hungarian. An extremal problem in graph theory.)",
395: 322: 478: 464: 506: 49: 457: 295: 546: 495:
Sidorenko, A. (1995), "What we know and what we do not know about Turán numbers",
172: 37: 510: 282:{\displaystyle T(n,k,r)\geq {\binom {n}{r}}{\binom {k}{r}}^{-1}.} 56:
vertices contains an edge. This number was determined for
463:(2nd ed.), Boca Raton: Chapman & Hall/ CRC, 194: 456: 281: 455:Colbourn, Charles J.; Dinitz, Jeffrey H. (2007), 261: 248: 238: 225: 438: 426: 414: 294:Equality holds if and only if there exists a 8: 175:form a Turán (7,5,4)-system. T(7,5,4) = 7. 267: 260: 247: 245: 237: 224: 222: 193: 73: 532:Magyar Tud. Akad. Mat. Kutato Int. Közl. 179:Relations to other combinatorial designs 163:) is the minimum size of such a system. 530:Turán, P. (1961), "Research problems", 407: 111:vertices. A set of blocks is called a 69: 61: 7: 171:The complements of the lines of the 76:) gives a survey of Turán numbers. 252: 229: 14: 459:Handbook of Combinatorial Designs 64:, and the problem for general 216: 198: 1: 441:, pg. 513, Proposition 32.12 484:Encyclopedia of Mathematics 574: 439:Colbourn & Dinitz 2007 427:Colbourn & Dinitz 2007 415:Colbourn & Dinitz 2007 391:Forbidden subgraph problem 44:is the smallest number of 498:Graphs and Combinatorics 477:Godbole, A. P. (2001) , 353:)-Turán system. Thus, T( 417:, pg. 649, Example 61.3 147:contains a block. The 48:-edges such that every 429:, pg. 649, Remark 61.4 283: 553:Extremal graph theory 284: 183:It can be shown that 558:Combinatorial design 396:Combinatorial design 192: 92:vertices. For given 16:In mathematics, the 143:-element subset of 511:10.1007/BF01929486 279: 68:was introduced in 60: = 2 by 259: 236: 565: 539: 526: 521:(in Hungarian), 513: 491: 473: 462: 442: 436: 430: 424: 418: 412: 288: 286: 285: 280: 275: 274: 266: 265: 264: 251: 243: 242: 241: 228: 50:induced subgraph 573: 572: 568: 567: 566: 564: 563: 562: 543: 542: 529: 519:Mat. Fiz. Lapok 516: 494: 476: 471: 454: 451: 446: 445: 437: 433: 425: 421: 413: 409: 404: 387: 246: 244: 223: 190: 189: 181: 169: 82: 12: 11: 5: 571: 569: 561: 560: 555: 545: 544: 541: 540: 527: 514: 505:(2): 179–199, 492: 479:"Turán number" 474: 469: 450: 447: 444: 443: 431: 419: 406: 405: 403: 400: 399: 398: 393: 386: 383: 339:)-lotto design 296:Steiner system 292: 291: 290: 289: 278: 273: 270: 263: 258: 255: 250: 240: 235: 232: 227: 221: 218: 215: 212: 209: 206: 203: 200: 197: 180: 177: 168: 165: 81: 78: 74:Sidorenko 1995 13: 10: 9: 6: 4: 3: 2: 570: 559: 556: 554: 551: 550: 548: 537: 533: 528: 524: 520: 515: 512: 508: 504: 500: 499: 493: 490: 486: 485: 480: 475: 472: 470:1-58488-506-8 466: 461: 460: 453: 452: 448: 440: 435: 432: 428: 423: 420: 416: 411: 408: 401: 397: 394: 392: 389: 388: 384: 382: 380: 376: 372: 368: 364: 360: 356: 352: 348: 344: 340: 338: 334: 330: 326: 319: 317: 313: 309: 305: 301: 297: 276: 271: 268: 256: 253: 233: 230: 219: 213: 210: 207: 204: 201: 195: 188: 187: 186: 185: 184: 178: 176: 174: 166: 164: 162: 158: 154: 150: 146: 142: 138: 134: 130: 126: 124: 120: 116: 110: 106: 102: 100: 95: 91: 87: 79: 77: 75: 72:. The paper ( 71: 67: 63: 59: 55: 51: 47: 43: 39: 35: 31: 27: 23: 19: 535: 531: 522: 518: 502: 496: 482: 458: 449:Bibliography 434: 422: 410: 378: 374: 370: 366: 362: 358: 354: 350: 346: 342: 336: 332: 328: 324: 320: 315: 311: 307: 303: 299: 293: 182: 170: 160: 156: 152: 149:Turán number 148: 144: 140: 136: 132: 128: 122: 118: 114: 112: 108: 107:is a set of 104: 98: 97: 93: 89: 85: 83: 70:Turán (1961) 65: 62:Turán (1941) 57: 53: 45: 41: 33: 29: 25: 21: 18:Turán number 17: 15: 139:) if every 80:Definitions 38:hypergraphs 547:Categories 402:References 173:Fano plane 84:Fix a set 538:: 417–423 525:: 436–452 489:EMS Press 269:− 220:≥ 40:of order 36:-uniform 385:See also 125:) system 341:is an ( 167:Example 113:Turán ( 32:) for 467:  365:) = L( 105:block 101:-edge 96:, an 465:ISBN 507:doi 381:). 321:An 318:). 103:or 88:of 52:on 549:: 534:, 523:48 503:11 501:, 487:, 481:, 361:, 349:, 345:, 314:, 310:- 306:, 302:- 298:S( 151:T( 135:≥ 131:≥ 20:T( 536:6 509:: 379:r 377:, 375:k 373:, 371:r 369:, 367:n 363:r 359:k 357:, 355:n 351:r 347:k 343:n 337:r 335:, 333:k 331:, 329:r 327:, 325:n 323:( 316:n 312:r 308:n 304:k 300:n 277:. 272:1 262:) 257:r 254:k 249:( 239:) 234:r 231:n 226:( 217:) 214:r 211:, 208:k 205:, 202:n 199:( 196:T 161:r 159:, 157:k 155:, 153:n 145:X 141:k 137:r 133:k 129:n 127:( 123:r 121:, 119:k 117:, 115:n 109:r 99:r 94:r 90:n 86:X 66:r 58:r 54:k 46:r 42:n 34:r 30:r 28:, 26:k 24:, 22:n

Index

hypergraphs
induced subgraph
Turán (1941)
Turán (1961)
Sidorenko 1995
Fano plane
Steiner system
(n,r,k,r)-lotto design
Forbidden subgraph problem
Combinatorial design
Colbourn & Dinitz 2007
Colbourn & Dinitz 2007
Colbourn & Dinitz 2007
Handbook of Combinatorial Designs
ISBN
1-58488-506-8
"Turán number"
Encyclopedia of Mathematics
EMS Press
Graphs and Combinatorics
doi
10.1007/BF01929486
Categories
Extremal graph theory
Combinatorial design

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.