The sampling paradigm of Karger (1995)
- Autor:
- Autor USP: KOHAYAKAWA, YOSHIHARU - IME
- Unidade: IME
- Assunto: COMBINATÓRIA
- Language: Inglês
- Imprenta:
- Source:
- Título: Anais
- Conference titles: Oficina Nacional em Problemas Combinatórios: Teoria, Algoritmos e Aplicações
-
ABNT
KOHAYAKAWA, Yoshiharu. The sampling paradigm of Karger. 1995, Anais.. São Paulo: IME-USP, 1995. Disponível em: https://repositorio.usp.br/directbitstream/d1811b95-37a9-4e21-91b8-ddb261d60aab/3161623.pdf. Acesso em: 06 maio 2026. -
APA
Kohayakawa, Y. (1995). The sampling paradigm of Karger. In Anais. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/d1811b95-37a9-4e21-91b8-ddb261d60aab/3161623.pdf -
NLM
Kohayakawa Y. The sampling paradigm of Karger [Internet]. Anais. 1995 ;[citado 2026 maio 06 ] Available from: https://repositorio.usp.br/directbitstream/d1811b95-37a9-4e21-91b8-ddb261d60aab/3161623.pdf -
Vancouver
Kohayakawa Y. The sampling paradigm of Karger [Internet]. Anais. 1995 ;[citado 2026 maio 06 ] Available from: https://repositorio.usp.br/directbitstream/d1811b95-37a9-4e21-91b8-ddb261d60aab/3161623.pdf - 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]
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3161623.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
