Andrzej Dudek

According to our database1, Andrzej Dudek authored at least 56 papers between 2006 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Large monochromatic components and long monochromatic cycles in random hypergraphs.
Eur. J. Comb., 2019

2018
Randomly twisted hypercubes.
Eur. J. Comb., 2018

Size-Ramsey numbers of cycles versus a path.
Discrete Mathematics, 2018

On offset Hamilton cycles in random hypergraphs.
Discrete Applied Mathematics, 2018

Note on the Multicolour Size-Ramsey Number for Paths, .
Electr. J. Comb., 2018

On Rainbow Hamilton Cycles in Random Hypergraphs.
Electr. J. Comb., 2018

Constructive Ramsey Numbers for Loose Hyperpaths.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
On some Multicolor Ramsey Properties of Random Graphs.
SIAM J. Discrete Math., 2017

On the Size-Ramsey Number of Hypergraphs.
Journal of Graph Theory, 2017

Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity.
J. Comb. Theory, Ser. B, 2017

On the Ramsey-Turán number with small s-independence number.
J. Comb. Theory, Ser. B, 2017

On the Number of Alternating Paths in Bipartite Complete Graphs.
Graphs and Combinatorics, 2017

2016
Acquaintance Time of Random Graphs Near Connectivity Threshold.
SIAM J. Discrete Math., 2016

The vertex size-Ramsey number.
Discrete Mathematics, 2016

The set chromatic number of random graphs.
Discrete Applied Mathematics, 2016

Weak and Strong Versions of the 1-2-3 Conjecture for Uniform Hypergraphs.
Electr. J. Comb., 2016

The Total Acquisition Number of Random Graphs.
Electr. J. Comb., 2016

2015
Rainbow Connection of Random Regular Graphs.
SIAM J. Discrete Math., 2015

Extensions of Results on Rainbow Hamilton Cycles in Uniform Hypergraphs.
Graphs and Combinatorics, 2015

An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths.
Combinatorics, Probability & Computing, 2015

Loose Hamilton Cycles in Regular Hypergraphs.
Combinatorics, Probability & Computing, 2015

2014
Maker-breaker games on random geometric graphs.
Random Struct. Algorithms, 2014

On Generalized Ramsey Numbers for 3-Uniform Hypergraphs.
Journal of Graph Theory, 2014

On generalized Ramsey numbers of Erdős and Rogers.
J. Comb. Theory, Ser. B, 2014

The t-Tone Chromatic Number of Random Graphs.
Graphs and Combinatorics, 2014

Approximate Counting of Matchings in (3,3)-Hypergraphs.
Electronic Colloquium on Computational Complexity (ECCC), 2014

On balanced colorings of sparse hypergraphs.
Discrete Mathematics, 2014

A Note on a Ramsey-Type Problem for Sequences.
Electr. J. Comb., 2014

Approximate Counting of Matchings in (3, 3)-Hypergraphs.
Proceedings of the Algorithm Theory - SWAT 2014, 2014

2013
Tight Hamilton cycles in random uniform hypergraphs.
Random Struct. Algorithms, 2013

Approximate counting of regular hypergraphs.
Inf. Process. Lett., 2013

On Minimum Saturated Matrices.
Graphs and Combinatorics, 2013

Some recent results on Ramsey-type numbers.
Discrete Applied Mathematics, 2013

2012
On induced Folkman numbers.
Random Struct. Algorithms, 2012

On the size and structure of graphs with a constant number of 1-factors.
Discrete Mathematics, 2012

Some remarks on vertex Folkman numbers for hypergraphs.
Discrete Mathematics, 2012

Cops and Robbers on Geometric Graphs.
Combinatorics, Probability & Computing, 2012

Optimal Divisibility Conditions for Loose Hamilton Cycles in Random Hypergraphs.
Electr. J. Comb., 2012

Rainbow Hamilton Cycles in Uniform Hypergraphs.
Electr. J. Comb., 2012

2011
Vertex colorings of graphs without short odd cycles.
Journal of Graph Theory, 2011

On the complexity of vertex-coloring edge-weightings.
Discrete Mathematics & Theoretical Computer Science, 2011

On the maximum number of edges in a hypergraph with a unique perfect matching.
Discrete Mathematics, 2011

Loose Hamilton Cycles in Random Uniform Hypergraphs.
Electr. J. Comb., 2011

On Ks-free subgraphs in Ks+k-free graphs and vertex Folkman numbers.
Combinatorica, 2011

2010
Flips in Graphs.
SIAM J. Discrete Math., 2010

An almost quadratic bound on vertex Folkman numbers.
J. Comb. Theory, Ser. B, 2010

Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence.
J. Comb. Optim., 2010

On k-partite hypergraphs with the induced epsilon-density property.
Discrete Mathematics, 2010

2009
On k-chromatically connected graphs.
Discrete Mathematics, 2009

A Note on Universal and Canonically Coloured Sequences.
Combinatorics, Probability & Computing, 2009

2008
Finding Folkman Numbers via MAX CUT Problem.
Electronic Notes in Discrete Mathematics, 2008

On the Folkman Number f(2, 3, 4).
Experimental Mathematics, 2008

On the Turán Properties of Infinite Graphs.
Electr. J. Comb., 2008

New Upper Bound on Vertex Folkman Numbers.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007
Identification of Noisy Variables for Nonmetric and Symbolic Data in Cluster Analysis.
Proceedings of the Data Analysis, Machine Learning and Applications, 2007

2006
Cluster Quality Indexes for Symbolic Classification - An Examination.
Proceedings of the Advances in Data Analysis, 2006


  Loading...