Home
Research
Teaching
Other
|
Publications
Conferences
Combinatorics at CMU

Publications
- On the Complexity of Vertex-Coloring Edge-Weightings (with D. Wajc), submitted
- On Minimum Saturated Matrices (with O. Pikhurko and A. Thomason), submitted
- A Note on the H-Free Process for Disconnected H, submitted
- Vertex Colorings of Graphs without Short Odd Cycles (with R. Ramadurai), submitted
- A New Proof of de Werra's Theorem, submitted
- On K_{s}-free Subgraphs in K_{s+k}-free Graphs and Vertex Folkman Numbers (with V. Rödl), submitted
- Flips in Graphs (with T. Bohman, A. Frieze, and O. Pikhurko), submitted
- Some Recent Results on Ramsey-Type Numbers (with P. Frankl and V. Rödl), submitted
- On the Function of Erdős and Rogers (survey) (with V. Rödl), to appear in Progress in
Mathematics
- On k-Partite Hypergraphs with the Induced eps-Density Property, to appear in Discrete Mathematics
- An Almost Quadratic Bound on Vertex Folkman Numbers (with V. Rödl), to appear in Journal of Combinatorial Theory Ser. B
- Subhypergraph Counts in Extremal and Random Hypergraphs and the Fractional q-Independence (with J. Polcyn and A. Ruciński), to appear in Journal of Combinatorial Optimization
- On k-Chromatically Connected Graphs (with E. Nastase and V. Rödl), to appear in Discrete Mathematics
- A Note on Universal and Canonically Coloured Sequences (with P. Frankl and V. Rödl), Combinatorics, Probability and Computing 18 (2009), no. 5, 683-689.
- Cliques in Steiner Systems (with F. Franek and V. Rödl), Mathematica Slovaca 59 (2009), no. 1, 109-120
- On the Folkman Number f(2,3,4) (with V. Rödl), Experimental Mathematics 17 (2008), no. 1, 63-67.
This paper received the $50 Prize for solution to Erdős problem (see also
Linyuan Lu's website)
- New Upper Bound on Vertex Folkman Numbers (extended abstract) (with V. Rödl), LATIN 2008, Lecture Notes in Computer Science, vol. 4957, Springer, 2008, pp. 473-478
- Finding Folkman Numbers via MAX-CUT Problem (extended abstract) (with V. Rödl), LAGOS 2007, Electronic Notes in Discrete Mathematics, vol. 30, Elsevier, 2008, pp. 99-104
- On the Turán Properties of Infinite Graphs (with V. Rödl), Electronic Journal of Combinatorics 15 (2008), #R47
- Planar Ramsey Numbers for Small Graphs (with A. Ruciński), 36th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Congressus Numerantium, vol. 176, 2005, pp. 201--220
«back
Selected talks and conferences
- Combinatorics: Methods and Applications in Mathematics and Computer Science - Topics in Graphs and Hypergraphs, Institute for Pure and Applied Mathematics, UCLA, November 2-6, 2009
- Talk: On K_{s}-free Subgraphs in K_{s+k}-free Graphs, The 14th International Conference on Random Structures and Algorithms, Poznań, Poland, August 3-7, 2009
- Talk: On K_{s}-free Subgraphs in K_{s+k}-free Graphs, DIMACS Workshop "Ramsey Theory Yesterday, Today, and Tomorrow", Rutgers University, May 27-29, 2009
- One-hour talk: Flips in Graphs, Combinatorics Seminar, Emory University, Atlanta, May 8, 2009
- One-hour talk: Flips in Graphs, Quantum Information Seminar, Department of Physics at Carnegie Mellon University, Pittsburgh, March 5, 2009
- One-hour talk: Cliques in Sparse Hypergraphs, Combinatorics Seminar, Emory University, Atlanta, October 31, 2008
- Talk: Cliques in Steiner Systems, 2nd Polish Combinatorial Conference, Będlewo, Poland, October 17-23, 2008
- Research meeting with Peter Frankl and Vojta Rödl, Tokyo, May 21-31, 2008
- New Directions in Algorithms, Combinatorics, and Optimization, GaTech, Atlanta, May 5-9, 2008
- One-hour talk: A Polynomial Bound on Vertex Folkman Numbers, Seminar of Algorithms, Combinatorics and Optimization Group at Carnegie Mellon University, Pittsburgh, April 15, 2008
- Talk: New Upper Bound on Vertex Folkman Numbers, LATIN '08 · 8th Latin American Theoretical INformatics, Rio de Janeiro, Brazil, April 7-11, 2008
- One-hour talk: New Upper Bound on Vertex Folkman Numbers, Seminar of Combinatorics and Combinatorial Optimization Research Group at University of São Paulo, São Paulo, Brazil, April 4, 2008
- One-hour talk: New Upper Bound on Vertex Folkman Numbers, Seminar of Discrete Mathematics Department, UAM, Poznań, Poland, December 18, 2007
- Talk: Finding Folkman Numbers via MAX-CUT Problem, LAGOS '07 · IV Latin-American Algorithms, Graphs and Optimization Symposium, Puerto Varas, Chile, November 25-29, 2007
- One-hour talk: On the Folkman numbers, MAX-CUT problem and semidefinite programming,
Advanced Optimization Laboratory at McMaster University, Hamilton, Canada, October 15, 2007
- Workshop in Continuous Optimization and Applications, Mathematical Science Research Institute, Berkeley, California, July 9-July 20, 2007
- Talk: On the Folkman Number f(2,3,4), The 13th International Conference on Random Structures and Algorithms, Tel Aviv, Israel, May 28-June 1, 2007
- Talk: On the Folkman Number f(2,3,4), 20th Cumberland Conference, Atlanta, May 17-19, 2007
- One-hour talk: On the Turán Properties of Infinite Graphs, Seminar of Discrete Mathematics Department, UAM, Poznań, Poland, January 9, 2007
«back
CMU combinatorics group & seminars
«back
|