Name
Abstract | ||
|---|---|---|
Advancing the sparse regularity method, we prove one-sided and two-sided regularity inheritance lemmas for subgraphs of bijumbled graphs, improving on results of Conlon, Fox, and Zhao. These inheritance lemmas also imply improved H-counting lemmas for subgraphs of bijumbled graphs, for some H. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1002/rsa.20851 | RANDOM STRUCTURES & ALGORITHMS |
Keywords | Field | DocType |
counting lemma,pseudorandom graphs,regularity inheritance,sparse regularity lemma,Szemeredi's regularity lemma | Discrete mathematics,Graph,Combinatorics,Lemma (mathematics),Mathematics,Pseudorandom number generator | Journal |
Volume | Issue | ISSN |
56.0 | 2.0 | 1042-9832 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter Allen | 1 | 9 | 1.18 |
| Julia Böttcher | 2 | 93 | 17.35 |
| Jozef Skokan | 3 | 251 | 26.55 |
| maya stein | 4 | 81 | 15.65 |