(Q101496532)

São Paulo Research Foundation

part of

NeuroMat

funder

object named as

FAPESP 2013/07699-0

1 reference

11 November 2020

title

Blow-up lemmas for sparse graphs (English)

1 reference

11 November 2020

author

Yoshiharu Kohayakawa

4

1 reference

26 February 2021

3

Hiep Hàn

1 reference

11 November 2020

Peter Allen

1

1 reference

https://doi.org/10.48550/arXiv.1612.00622

17 February 2023

Julia Böttcher

2

1 reference

https://doi.org/10.48550/arXiv.1612.00622

17 February 2023

Yury Person

5

1 reference

https://doi.org/10.48550/arXiv.1612.00622

17 February 2023

language of work or name

English

1 reference

11 November 2020

publication date

19 March 2019

1 reference

11 November 2020

full work available at URL

0 references

published in

arXiv

1 reference

https://arxiv.org/abs/1612.00622

A spanning bandwidth theorem in random graphs

10 August 2021

cites work

1

1 reference

The Bandwidth Theorem in Sparse Graphs

22 February 2021

2

1 reference

Chromatic thresholds in dense random graphs

22 February 2021

3

1 reference

Powers of Hamilton cycles in pseudorandom graphs

22 February 2021

4

1 reference

22 February 2021

Making spanning graphs

5

1 reference

Triangle-free subgraphs of random graphs

22 February 2021

6

1 reference

Regularity inheritance in pseudorandom graphs

22 February 2021

7

1 reference

Explicit Ramsey graphs and orthonormal labelings

22 February 2021

8

1 reference

Additive Patterns in Multiplicative Subgroups

22 February 2021

9

1 reference

Sparse universal graphs for bounded-degree graphs

22 February 2021

10

1 reference

Universality and tolerance

22 February 2021

12

1 reference

Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions

22 February 2021

13

1 reference

The Algorithmic Aspects of the Regularity Lemma

22 February 2021

14

1 reference

Spanning subgraphs of random graphs

22 February 2021

15

1 reference

The Probabilistic Method.

22 February 2021

17

1 reference

Corrádi and Hajnal's Theorem for Sparse Random Graphs

22 February 2021

18

1 reference

Independent sets in hypergraphs

22 February 2021

19

1 reference

Harnessing the Bethe free energy

22 February 2021

20

1 reference

22 February 2021

Combinatorial Games

21

1 reference

Biased Positional Games for Which Random Strategies are Nearly Optimal

22 February 2021

22

1 reference

22 February 2021

Random Graphs

23

44

1 reference

Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal

22 February 2021

24

1 reference

An Extension of the Blow-up Lemma to Arrangeable Graphs

22 February 2021

25

1 reference

Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs

22 February 2021

26

1 reference

Proof of the bandwidth conjecture of Bollobás and Komlós

22 February 2021

27

1 reference

Limits of discrete distributions and Gibbs measures on random graphs

22 February 2021

28

1 reference

Almost-spanning universality in random graphs

22 February 2021

29

1 reference

Extremal results in sparse pseudorandom graphs

22 February 2021

30

1 reference

On the KŁR conjecture in random graphs

22 February 2021

31

1 reference

On the Resilience of Long Cycles in Random Graphs

22 February 2021

33

1 reference

An improved upper bound on the density of universal random graphs

22 February 2021

34

1 reference

Generating random graphs in biased Maker-Breaker games

22 February 2021

36

1 reference

Spanning universality in random graphs

22 February 2021

37

1 reference

Universality of random graphs and rainbow embedding

22 February 2021

38

1 reference

Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring

22 February 2021

39

1 reference

Small subsets inherit sparse ε-regularity

22 February 2021

40

1 reference

The primes contain arbitrarily long arithmetic progressions

22 February 2021

41

1 reference

Bandwidth theorem for random graphs

22 February 2021

43

1 reference

A hypergraph blow-up lemma

22 February 2021

45

1 reference

A fast algorithm for equitable coloring

22 February 2021

46

1 reference

Universality of Random Graphs for Graphs of Maximum Degree Two

22 February 2021

47

1 reference

Szemerédi’s Regularity Lemma for Sparse Graphs

22 February 2021

48

1 reference

On K4-free subgraphs of random graphs

22 February 2021

49

1 reference

Regular pairs in sparse random graphs I: Regular Pairs in Sparse Random Graphs I

22 February 2021

50

1 reference

On The Triangle Removal Lemma For Subgraphs of Sparse Pseudorandom Graphs

22 February 2021

51

1 reference

Sparse partition universal graphs for graphs of bounded degree

22 February 2021

52

1 reference

Recent trends in combinatorics: the legacy of Paul Erdős

22 February 2021

53

1 reference

22 February 2021

Blow-up Lemma

54

1 reference

An Algorithmic Version of the Blow-up Lemma

22 February 2021

55

1 reference

The Regularity Lemma and Its Applications in Graph Theory

22 February 2021

56

1 reference

The critical bias for the Hamiltonicity game is (1+o(1))n/ln(n)

22 February 2021

58

1 reference

Resilient Pancyclicity of Random and Pseudorandom Graphs

22 February 2021

60

1 reference

Robust Hamiltonicity of Dirac graphs

22 February 2021

61

1 reference

Sparse pseudo-random graphs are Hamiltonian

22 February 2021

62

1 reference

Triangle Factors In Sparse Pseudo-Random Graphs

22 February 2021

63

1 reference

The Hungarian method for the assignment problem

22 February 2021

64

1 reference

Embedding bounded degree spanning trees in random graphs

22 February 2021

66

1 reference

On a Problem of Formal Logic

22 February 2021

67

1 reference

Perfect Matchings in ϵ-Regular Graphs and the Blow-Up Lemma

22 February 2021

68

1 reference

Hypergraph Packing and Graph Embedding

22 February 2021

69

1 reference

22 February 2021

Hypergraph containers

70

1 reference

Szemerédi's Regularity Lemma for Matrices and Sparse Graphs

22 February 2021

71

1 reference

Local resilience of graphs

22 February 2021

72

1 reference

On sets of integers containing no k elements in arithmetic progression

22 February 2021

73

1 reference

Massive gene swamping among cheese-making Penicillium fungi

22 February 2021

74

1 reference

22 February 2021

Pseudo-Random Graphs

75

1 reference