Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275)

From MaRDI portal
Revision as of 01:23, 23 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
scientific article

    Statements

    title
    Embedding Graphs into Larger Graphs: Results, Methods, and Problems (English)
    0 references
    author
    Endre Szemerédi
    0 references
    Miklós Simmonovits
    0 references
    publication date
    8 July 2020
    0 references
    zbMATH Keywords
    extremal graphs
    0 references
    stability
    0 references
    regularity lemma
    0 references
    semi-random methods
    0 references
    embedding
    0 references
    cites work
    Q4871074
    0 references
    Q4871780
    0 references
    Q4780792
    0 references
    Q4230372
    0 references
    Q2798999
    0 references
    Q3576672
    0 references
    An anti-Ramsey theorem
    0 references
    Hypergraphs Do Jump
    0 references
    Additive Combinatorics
    0 references
    Digraphs
    0 references
    Q4200095
    0 references
    Q4088853
    0 references
    Q3852212
    0 references
    Q4871771
    0 references
    Q2743189
    0 references
    Q5688999
    0 references
    Pancyclic graphs. I
    0 references
    Q3424888
    0 references
    Q2934629
    0 references
    Q3734434
    0 references
    Q5672676
    0 references
    Q5610936
    0 references
    Q4410007
    0 references
    Q4075489
    0 references
    Q4873802
    0 references
    Q4100121
    0 references
    Q4326635
    0 references
    Q3832612
    0 references
    Subgraphs of graphs. I
    0 references
    Q5842452
    0 references
    Quasi-random graphs
    0 references
    Q4120601
    0 references
    \(k\)-fold Sidon sets
    0 references
    Graph removal lemmas
    0 references
    Q3060859
    0 references
    Q4787524
    0 references
    Q4209045
    0 references
    Q5771387
    0 references
    Q5829865
    0 references
    Q5543308
    0 references
    Q5510578
    0 references
    Q5578805
    0 references
    Q5544083
    0 references
    Q5608848
    0 references
    Q5578804
    0 references
    Q5616962
    0 references
    Q5638326
    0 references
    Q4773670
    0 references
    Q4050640
    0 references
    Q4101818
    0 references
    Q3926659
    0 references
    Q3813824
    0 references
    Q3815266
    0 references
    Q4878657
    0 references
    Q4347893
    0 references
    Q5734432
    0 references
    Q4133658
    0 references
    Q4074927
    0 references
    Q5622807
    0 references
    Q4346784
    0 references
    Q3286850
    0 references
    Q5520566
    0 references
    Q5725269
    0 references
    Q5567712
    0 references
    Q5610919
    0 references
    Q3918134
    0 references
    Q3679225
    0 references
    Q5610920
    0 references
    Q4065548
    0 references
    Q3041274
    0 references
    Q4835632
    0 references
    Q4068753
    0 references
    Q3215325
    0 references
    Q5500302
    0 references
    Q3348932
    0 references
    Q4866084
    0 references
    4-books of three pages
    0 references
    Q5548200
    0 references
    Q3416250
    0 references
    Quasirandom Groups
    0 references
    Q3078219
    0 references
    Q3997075
    0 references
    Sum-product formulae
    0 references
    Q3977492
    0 references
    Q4170743
    0 references
    Q5620621
    0 references
    Tree embeddings
    0 references
    On pancyclic digraphs
    0 references
    Q4519896
    0 references
    Q5153964
    0 references
    Q5582098
    0 references
    Q4052170
    0 references
    Q3746576
    0 references
    Q2874923
    0 references
    Q5512796
    0 references
    Q3089368
    0 references
    Q5419956
    0 references
    Counting designs
    0 references
    Q3656238
    0 references
    Q4407452
    0 references
    Q3078208
    0 references
    Q3439712
    0 references
    The Blow-up Lemma
    0 references
    Tiling Turán theorems
    0 references
    Blow-up lemma
    0 references
    Q4242960
    0 references
    Q4736881
    0 references
    Q4878666
    0 references
    Q5477817
    0 references
    Q5539649
    0 references
    Q5672936
    0 references
    Q4044577
    0 references
    Q4770982
    0 references
    Q3859790
    0 references
    Q3880849
    0 references
    Very large graphs
    0 references
    Q4899293
    0 references
    Q4106232
    0 references
    Q3669452
    0 references
    Ramanujan graphs
    0 references
    Q4226448
    0 references
    Q5721211
    0 references
    Cycles and stability
    0 references
    Q4589014
    0 references
    Q4339095
    0 references
    Q4633828
    0 references
    Q4079637
    0 references
    Q4871768
    0 references
    Q5722819
    0 references
    Q5342985
    0 references
    Flag algebras
    0 references
    Q5680714
    0 references
    Q5371208
    0 references
    Q3078214
    0 references
    Q3568712
    0 references
    Q4247195
    0 references
    Q4175585
    0 references
    Q3822189
    0 references
    Q5371305
    0 references
    Hypergraph containers
    0 references
    Q3658805
    0 references
    Q5548826
    0 references
    Q3214947
    0 references
    Q4053705
    0 references
    Q3312262
    0 references
    Q3039385
    0 references
    Q3220623
    0 references
    Q5689007
    0 references
    Q4263484
    0 references
    Q2874933
    0 references
    Ramsey-Turán theory
    0 references
    Q5666597
    0 references
    Q4133991
    0 references
    Q3976643
    0 references
    Q4410040
    0 references
    Q3481743
    0 references
    Q4589015
    0 references
    Q5675912
    0 references
    Q4401979
    0 references
    Q4200109
    0 references
    Q5480762
    0 references
    Q3768936
    0 references
    Q3825110
    0 references
    Q4193489
    0 references
    Q5675743
    0 references
    Q5781249
    0 references
    Q3214957
    0 references
    Q4083463
    0 references
    Bipartite Graph Tiling
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C35
    0 references
    05D10
    0 references
    05D40
    0 references
    05C45
    0 references
    05C65
    0 references
    05C80
    0 references
    05C60
    0 references
    zbMATH DE Number
    7218912
    0 references
    OpenAlex ID
    W2993699426
    0 references
    arXiv ID
    1912.02068
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3295275&oldid=36599013"
    Powered by MediaWiki