Szemerédi’s regularity lemma for sparse graphs (1997)
- Autor:
- Autor USP: KOHAYAKAWA, YOSHIHARU - IME
- Unidade: IME
- DOI: 10.1007/978-3-642-60539-0_16
- Subjects: TEORIA DOS GRAFOS; GRAFOS ALEATÓRIOS
- Keywords: Arithmetic Progression; Sparse Graph; London Mathematical Society Lecture Note; Regularity Lemma
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Selected papers
- Conference titles: Conference on Foundations of Computational Mathematics
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
KOHAYAKAWA, Yoshiharu. Szemerédi’s regularity lemma for sparse graphs. 1997, Anais.. Berlin: Springer, 1997. Disponível em: https://doi.org/10.1007/978-3-642-60539-0_16. Acesso em: 03 mar. 2026. -
APA
Kohayakawa, Y. (1997). Szemerédi’s regularity lemma for sparse graphs. In Selected papers. Berlin: Springer. doi:10.1007/978-3-642-60539-0_16 -
NLM
Kohayakawa Y. Szemerédi’s regularity lemma for sparse graphs [Internet]. Selected papers. 1997 ;[citado 2026 mar. 03 ] Available from: https://doi.org/10.1007/978-3-642-60539-0_16 -
Vancouver
Kohayakawa Y. Szemerédi’s regularity lemma for sparse graphs [Internet]. Selected papers. 1997 ;[citado 2026 mar. 03 ] Available from: https://doi.org/10.1007/978-3-642-60539-0_16 - Weak hypergraph regularity and linear hypergraphs
- Property testing and parameter testing for permutations
- The induced size-Ramsey number of cycles
- An extension of the blow-up lemma to arrangeable graphs
- The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
- Regular pairs in sparse random graphs I
- Powers of Hamilton cycles in pseudorandom graphs
- An unstable hypergraph problem with a unique optimal solution
- Turán's extremal problem in random graphs: forbidding even cycles
- Special issue on Ramsey theory. [Editorial]
Informações sobre o DOI: 10.1007/978-3-642-60539-0_16 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
980698.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
