×

Found 87 Documents (Results 1–87)

Monochromatic trees in random graphs. (English) Zbl 1379.05025

Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 759-764 (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the number of \(r\)-transitive orientations of \(G(n,p)\). (English) Zbl 1378.05181

Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 255-261 (2017).
MSC:  05C80 05C20
PDFBibTeX XMLCite
Full Text: DOI

Estimating parameters associated with monotone properties. (English) Zbl 1398.68399

Jansen, Klaus (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. Proceedings of the 19th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2016, and the 20th international workshop on randomization and computation, RANDOM 2016, Paris, France, September 7–9, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-018-7). LIPIcs – Leibniz International Proceedings in Informatics 60, Article 35, 13 p. (2016).
MSC:  68R10 05C80 68W20
PDFBibTeX XMLCite
Full Text: DOI arXiv

A counting lemma for sparse pseudorandom hypergraphs. (English) Zbl 1347.05132

Campêlo, Manoel (ed.) et al., LAGOS ’15. Selected papers of the 8th Latin-American algorithms, graphs, and optimization symposium, Praia das Fontes, Beberibe, Brazil, May 11–15, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 50, 421-426, electronic only (2015).
MSC:  05C65 05C42 05C80
PDFBibTeX XMLCite
Full Text: DOI

Triangle-free subgraphs of random graphs. (English) Zbl 1346.05262

Nešetril, Jaroslav (ed.) et al., Extended abstracts of the eight European conference on combinatorics, graph theory and applications, EuroComb 2015, Bergen, Norway, August 31 – September 4, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 49, 393-397, electronic only (2015).
MSC:  05C80 05C60
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Powers of Hamilton cycles in pseudorandom graphs. (English) Zbl 1406.05092

Pardo, Alberto (ed.) et al., LATIN 2014: theoretical informatics. 11th Latin American symposium, Montevideo, Uruguay, March 31 – April 4, 2014. Proceedings. Berlin: Springer (ISBN 978-3-642-54422-4/pbk). Lecture Notes in Computer Science 8392, 355-366 (2014).
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

An improved upper bound on the density of universal random graphs. (English) Zbl 1266.05151

Fernández-Baca, David (ed.), LATIN 2012: Theoretical informatics. 10th Latin American symposium, Arequipa, Peru, April 16–20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29343-6/pbk). Lecture Notes in Computer Science 7256, 231-242 (2012).
MSC:  05C80 68R10
PDFBibTeX XMLCite
Full Text: DOI

The maximum size of a Sidon set contained in a sparse random set of integers. (English) Zbl 1381.11011

Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 159-171 (2011).
PDFBibTeX XMLCite
Full Text: Link

On an anti-Ramsey property of random graphs. (English) Zbl 1268.05181

Bonomo, Flavia (ed.) et al., LAGOS’11 – VI Latin-American algorithms, graphs, and optimization symposium. Extended abstracts from the symposium, Bariloche, Argentina, March 28–April 1, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 37, 237-242 (2011).
MSC:  05C80 05C55
PDFBibTeX XMLCite
Full Text: DOI

A note on random \(k\)-dimensional posets. (English) Zbl 1268.06002

Bonomo, Flavia (ed.) et al., LAGOS’11 – VI Latin-American algorithms, graphs, and optimization symposium. Extended abstracts from the symposium, Bariloche, Argentina, March 28–April 1, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 37, 51-56 (2011).
PDFBibTeX XMLCite
Full Text: DOI

A note on counting orientations. (English) Zbl 1268.05182

Bonomo, Flavia (ed.) et al., LAGOS’11 – VI Latin-American algorithms, graphs, and optimization symposium. Extended abstracts from the symposium, Bariloche, Argentina, March 28–April 1, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 37, 3-8 (2011).
MSC:  05C80 05C20
PDFBibTeX XMLCite
Full Text: DOI

On the triangle removal lemma for subgraphs of sparse pseudorandom graphs. (English) Zbl 1213.05238

Bárány, Imre (ed.) et al., An irregular mind. Szmerédi is 70. Dedicated to Endre Szemerédi on the occasion of his seventieth birthday. Berlin: Springer (ISBN 978-3-642-14443-1/pbk). Bolyai Society Mathematical Studies 21, 359-404 (2010).
MSC:  05C80
PDFBibTeX XMLCite

Almost spanning subgraphs of random graphs after adversarial edge removal. (English) Zbl 1268.05176

Liebling, Thomas M. (ed.) et al., LAGOS’09 – V Latin-American algorithms, graphs, and optimization symposium. Papers from the symposium, Gramado, Brazil, November 3–7, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 35, 335-340 (2009).
MSC:  05C80
PDFBibTeX XMLCite
Full Text: DOI arXiv

Universality of random graphs. (English) Zbl 1192.05143

Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, January 20–22, 2008. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-898716-47-4). 782-788 (2008).
MSC:  05C80
PDFBibTeX XMLCite

A practical minimal perfect hashing method. (English) Zbl 1121.68332

Nikoletseas, Sotiris E. (ed.), Experimental and efficient algorithms. 4th international workshop, WEA 2005, Santorini Island, Greece, May 10–13, 2005. Proceedings. Berlin Springer (ISBN 3-540-25920-1/pbk). Lecture Notes in Computer Science 3503, 488-500 (2005).
MSC:  68P05 05C80
PDFBibTeX XMLCite
Full Text: DOI

Measures of pseudorandomness for finite sequences: minimum and typical values. (Extended abstract). (English) Zbl 1183.11043

Harju, Tero (ed.) et al., Proceedings of WORDS’03, the 4th international conference on combinatorics on words, Turku, Finland, September 10–13, 2003. Turku: Turku Centre for Computer Science (ISBN 952-12-1211-X/pbk). TUCS General Publication 27, 159-169 (2003).
PDFBibTeX XMLCite

Szemerédi’s regularity lemma for sparse graphs. (English) Zbl 0868.05042

Cucker, Felipe (ed.) et al., Foundations of computational mathematics. Selected papers of a conference, held at IMPA in Rio de Janeiro, Brazil, January 1997. Berlin: Springer. 216-230 (1997).
MSC:  05C70 05C80
PDFBibTeX XMLCite
Full Text: DOI

A note on long-range percolation. (English) Zbl 0870.05064

Alavi, Y. (ed.) et al., Graph theory, combinatorics, algorithms and applications. Vol. 1. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley. 97-113 (1995).
MSC:  05C80 82B43
PDFBibTeX XMLCite

On the evolution of random Boolean functions. (English) Zbl 0817.94030

Frankl, P. (ed.) et al., Extremal problems for finite sets. Proceedings of the conference, held in Visegrád, Hungary between June 16-21, 1991. Budapest: János Bolyai Mathematical Society. Bolyai Soc. Math. Stud. 3, 137-156 (1994).
MSC:  94C10 06E30 60C05
PDFBibTeX XMLCite

Filter Results by …

Database

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field