Estimating parameters associated with monotone properties (2016)
- Authors:
- Autor USP: KOHAYAKAWA, YOSHIHARU - IME
- Unidade: IME
- DOI: 10.4230/LIPIcs.APPROX-RANDOM.2016.35
- Assunto: TEORIA DOS GRAFOS
- Keywords: parameter estimation; parameter testing; edit distance to monotone graph properties; entropy of subgraph classes; speed of subgraph classes
- Language: Inglês
- Imprenta:
- Publisher: Schloss Dagstuhl
- Publisher place: Wadern
- Date published: 2016
- Source:
- Conference titles: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
HOPPEN, Carlos et al. Estimating parameters associated with monotone properties. 2016, Anais.. Wadern: Schloss Dagstuhl, 2016. Disponível em: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.35. Acesso em: 19 jan. 2026. -
APA
Hoppen, C., Kohayakawa, Y., Lang, R., Lefmann, H., & Stagni, H. (2016). Estimating parameters associated with monotone properties. In Approximation, randomization, and combinatorial optimization. Algorithms and Techniques. Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.APPROX-RANDOM.2016.35 -
NLM
Hoppen C, Kohayakawa Y, Lang R, Lefmann H, Stagni H. Estimating parameters associated with monotone properties [Internet]. Approximation, randomization, and combinatorial optimization. Algorithms and Techniques. 2016 ;[citado 2026 jan. 19 ] Available from: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.35 -
Vancouver
Hoppen C, Kohayakawa Y, Lang R, Lefmann H, Stagni H. Estimating parameters associated with monotone properties [Internet]. Approximation, randomization, and combinatorial optimization. Algorithms and Techniques. 2016 ;[citado 2026 jan. 19 ] Available from: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.35 - Upper bounds on probability thresholds for asymmetric Ramsey properties
- An improved upper bound on the density of universal random graphs
- A note on permutation regularity
- Turan's theorem for pseudo-random graphs
- Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
- Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number
- Packing and covering triangles in graphs
- Near-perfect clique-factors in sparse pseudorandom graphs
- Measures of pseudorandomness for finite sequences: minimum and typical values
- On the number of r-transitive orientations of G (n, p)
Informações sobre o DOI: 10.4230/LIPIcs.APPROX-RANDOM.2016.35 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
