Extremal results for random discrete structures
type: Item
instance of: scholarly article
title: Extremal results for random discrete structures
zbMATH Open document ID: 1351.05207
author: M. Schacht
published in: Annals of Mathematics. Second Series
publication date: 2016-12-07T00:00:00Z
full work available at URL: https://arxiv.org/abs/1603.00894
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05D40
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 60C05
zbMATH DE Number: 6662215
zbMATH Keywords: random graphs
zbMATH Keywords: Szemerédi's theorem
zbMATH Keywords: thresholds
zbMATH Keywords: Turán's theorem
MaRDI profile type: Publication
Wikidata QID: Q97694035
OpenAlex ID: W3103981711
arXiv ID: 1603.00894
cites work: Extremal subgraphs of random graphs
cites work: Q3852212
cites work: Q4398864
cites work: Random graphs.
cites work: Q5422499
cites work: Combinatorial theorems in sparse random sets
cites work: Q3577833
cites work: On the structure of linear graphs
cites work: Q5771387
cites work: On extremal problems of graphs and generalized graphs
cites work: Supersaturated graphs and hypergraphs
cites work: On Some Sequences of Integers
cites work: Quantitative theorems for regular systems of equations
cites work: Large triangle-free subgraphs in graphs without \(K_ 4\)
cites work: Ramsey properties of random discrete structures
cites work: Random Ramsey graphs for the four-cycle
cites work: An ergodic Szemerédi theorem for commuting transformations
cites work: K5‐free subgraphs of random graphs
cites work: On Schur properties of random subsets of integers
cites work: Q3063534
cites work: Turán's extremal problem in random graphs: Forbidding even cycles
cites work: Turán's extremal problem in random graphs: Forbidding odd cycles
cites work: Q4519896
cites work: Q5512796
cites work: An extremal problem for random graphs and the number of graphs with large even-girth
cites work: Arithmetic progressions of length three in subsets of a random set
cites work: On \(K^ 4\)-free subgraphs of random graphs
cites work: The Turn Theorem for Random Graphs
cites work: On a problem of K. Zarankiewicz
cites work: Studien zur Kombinatorik
cites work: Threshold Functions for Ramsey Properties
cites work: Rado Partition Theorem for Random Subsets of Integers
cites work: Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs
cites work: Turán's theorem in sparse random graphs
cites work: On sets of integers containing k elements in arithmetic progression
cites work: Q5781249
DOI: 10.4007/ANNALS.2016.184.2.1
description: scientific article