Extremal results in sparse pseudorandom graphs (Q2445889): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Extremal results for odd cycles in sparse pseudorandom graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Ramsey graphs and orthonormal labelings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Algorithmic Aspects of the Regularity Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient testing of large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the independence number via the \(\vartheta\)-function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Cut-Norm via Grothendieck's Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive approximation for edge-deletion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifts, discrepancy and nearly optimal spectral gap / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Ramsey multiplicities of graphs—problems and recent results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced-universal graphs for graphs with bounded maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Turán Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Random Set Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse quasi-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi‐random graphs with given degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number of a graph with bounded maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Sparse Regularity Concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound for diagonal Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for graph regularity and removal lemmas / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate version of Sidorenko's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial theorems in sparse random sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the KŁR conjecture in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4056030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Folkman Number<i>f</i>(2, 3, 4) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5724802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5578805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting a graph into two dissimilar halves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Imbalances in k‐colorations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of linear graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: There exist graphs with super‐exponential Ramsey multiplicity constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the graph removal lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Ramsey-type theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two remarks on the Burr-Erdős conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey properties of random discrete structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small subsets inherit sparse \(\varepsilon\)-regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic counting lemma for complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Acquaintances and Strangers at any Party / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds of tower type for Szemerédi's uniformity lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph regularity and the multidimensional Szemerédi theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasirandom Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with linear Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Szemerédi-type regularity lemma in abelian groups, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The primes contain arbitrarily long arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán's extremal problem in random graphs: Forbidding even cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Szemerédi’s Regularity Lemma for Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(K^ 4\)-free subgraphs of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular pairs in sparse random graphs I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán's theorem for pseudo-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3078208 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse partition universal graphs for graphs of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding graphs with bounded degree in sparse pseudorandom graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial proof of the removal lemma for groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of dense graph sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Construction of Small Folkman Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On induced Ramsey numbers for graphs with bounded maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The counting lemma for regular <i>k</i>‐uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of cliques in graphs of given order and size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimal Density of Triangles in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clique density theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold Functions for Ramsey Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3060865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity Lemma for k-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4175585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph containers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal results for random discrete structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Szemerédi's Regularity Lemma for Matrices and Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A correlation inequality for bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5548826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Turán's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sets of integers containing k elements in arithmetic progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of the hypergraph removal lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3825110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Disproof of a Conjecture of Erdős in Ramsey Theory / rank
 
Normal rank

Revision as of 09:29, 8 July 2024

scientific article
Language Label Description Also known as
English
Extremal results in sparse pseudorandom graphs
scientific article

    Statements

    Extremal results in sparse pseudorandom graphs (English)
    0 references
    0 references
    0 references
    0 references
    15 April 2014
    0 references
    Szemerédi's regularity lemma
    0 references
    sparse regularity lemma
    0 references
    counting lemma
    0 references
    graph removal lemma
    0 references
    extremal combinatorics
    0 references
    sparse graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references