Faculty

Institution

Unit

Venue

Andrzej Dudek

Professor

Western Michigan University

Affiliations

College of Arts and Sciences

Mathematics

Andrzej Dudek is currently serving as a College Of Arts And Sciences Professor at Western Michigan University.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Andrzej Dudek

Western Michigan University

Professor

You can click a keyword to filter the displayed items

graph theory combinatorics applied mathematics discrete mathematics mathematics combinatorial theory discrete algorithms extremal graph theory hypergraph theory combinatorial optimization mathematical sciences random graphs extremal combinatorics structural graph theory enumerative combinatorics probabilistic graph theory probability theory theoretical computer science statistical physics analytic combinatorics set theory algebraic graph theory computer science topological graph theory graph matching combinatorial problems game theory geometric topology geometric graph theory vertex folkman numbers rainbow hamilton cycles uniform hypergraphs random hypergraphs regular hypergraphs polyhedron algebraic combinatorics combinatorial designs hamiltonian cycles hamilton cycle data science dynamical systems spectral theory scientific computing general linguistics graph analysis matrix theory network theory size-ramsey number nonlinear phenomena developmental science global networks networked system design distributed systems experimental criminology knot theory randomized algorithms edge detection criminal behavior edge intelligence lower bounds matrix analysis graphology graphical analysis complementarity problems oriented matroids discrete dynamics pattern analysis pattern matching multicolor ramsey properties vertex-coloring edge-weightings tight hamilton cycles random uniform hypergraphs alternative proof optimal divisibility conditions random regular graphs rainbow connection

Notable Scholarly Works

Notable Federal Grants

Collaborators

A Random Coloring Process Gives Improved Bounds for the ErdőS-GyáRfáS Problem on Generalized Ramsey Numbers. The Electronic Journal of Combinatorics (2025)

combinatorial theorydiscrete mathematicsenumerative combinatoricserdős-gyárfás problemextremal combinatoricscombinatoricsasymptotic analysisgraph theorycombinatory analysisgeneralized ramsey numbersapplied mathematicsmathematicsextremal graph theorydiscrete algorithms

Generalized Ramsey Numbers at the Linear and Quadratic Thresholds. The Electronic Journal of Combinatorics (2025)

Patrick BennettRyan CushmanAndrzej Dudek

ramsey numbersgraph theoryquadratic thresholdsapplied mathematics

A Note on Non-Isomorphic Edge-Color Classes in Random Graphs. Graphs and Combinatorics (2024)

Patrick BennettRyan CushmanAndrzej DudekElizabeth Sprangel

machine learninggraph theorynon-isomorphic edge-color classessocial sciences

ErdőS-Szekeres Type Theorems for Ordered Uniform Matchings. Journal of Combinatorial Theory Series B (2024)

Andrzej DudekJarosław GrytczukAndrzej Ruciński

ordered uniform matchingsgraph theorytheoretical computer scienceapplied mathematicserdos-szekeres type theorems

Largest Bipartite Sub-Matchings of a Random Ordered Matching or a Problem With Socks. Enumerative Combinatorics and Applications (2024)

Andrzej DudekJarosław GrytczukAndrzej Rucinski

enumerative combinatoricsextremal combinatoricscombinatoricslargest bipartite sub-matchingsapplied mathematicsanalytic combinatorics

Ordered Unavoidable Sub-Structures in Matchings and Random Matchings. The Electronic Journal of Combinatorics (2024)

Andrzej DudekJarosław GrytczukAndrzej Ruciński

combinatoricsrandom matchingsapplied mathematics

The ErdőS-GyáRfáS Function F ( N, 4, 5 ) = 5 6 N <MML: Mo Linebreak="Goodbreak" …. Journal of Combinatorial Theory Series B (2024)

Patrick BennettRyan CushmanAndrzej DudekPaweł Prałat

molecular biologycombinatorics

The Generalized Ramsey Number $F(N, 5, 8) = \Frac 67 N + O(N)$. arXiv (Cornell University) (2024)

Bennett, PatrickCushman, RyanDudek, Andrzej

combinatorial theorycombinatoricsgroup theoryfinite fieldsabstract complexitynumber theorygeneralized ramsey numberapplied mathematicsmathematics

Twins in Ordered Hyper-Matchings. Discussiones Mathematicae Graph Theory (2024)

Andrzej DudekJaros\l aw GrytczukAndrzej Ruciński

ordered hyper-matchingsgraph theoryhypergraph theoryapplied mathematics

ErdőS-Szekeres Type Theorems for Ordered Uniform Matchings. arXiv (Cornell University) (2023)

combinatorial theoryerdős-szekeres type theoremsdiscrete mathematicscombinatorial optimizationgraph matchingcombinatoricsgraph theoryset theorytheoretical computer sciencemathematical sciencesapplied mathematicsmathematicsdiscrete algorithms

1
2
3
4
5
16
10 / page

Andrzej Dudek

Professor

Western Michigan University

Affiliations

College of Arts and Sciences

Mathematics

Andrzej Dudek is currently serving as a College Of Arts And Sciences Professor at Western Michigan University.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Andrzej Dudek

Western Michigan University

Professor

You can click a keyword to filter the displayed items

Notable Scholarly Works

Notable Federal Grants

Collaborators

A Random Coloring Process Gives Improved Bounds for the ErdőS-GyáRfáS Problem on Generalized Ramsey Numbers. The Electronic Journal of Combinatorics (2025)

Generalized Ramsey Numbers at the Linear and Quadratic Thresholds. The Electronic Journal of Combinatorics (2025)

Patrick BennettRyan CushmanAndrzej Dudek

ramsey numbersgraph theoryquadratic thresholdsapplied mathematics

A Note on Non-Isomorphic Edge-Color Classes in Random Graphs. Graphs and Combinatorics (2024)

Patrick BennettRyan CushmanAndrzej DudekElizabeth Sprangel

machine learninggraph theorynon-isomorphic edge-color classessocial sciences

ErdőS-Szekeres Type Theorems for Ordered Uniform Matchings. Journal of Combinatorial Theory Series B (2024)

Andrzej DudekJarosław GrytczukAndrzej Ruciński

ordered uniform matchingsgraph theorytheoretical computer scienceapplied mathematicserdos-szekeres type theorems

Largest Bipartite Sub-Matchings of a Random Ordered Matching or a Problem With Socks. Enumerative Combinatorics and Applications (2024)

Andrzej DudekJarosław GrytczukAndrzej Rucinski

enumerative combinatoricsextremal combinatoricscombinatoricslargest bipartite sub-matchingsapplied mathematicsanalytic combinatorics

Ordered Unavoidable Sub-Structures in Matchings and Random Matchings. The Electronic Journal of Combinatorics (2024)

Andrzej DudekJarosław GrytczukAndrzej Ruciński

combinatoricsrandom matchingsapplied mathematics

The ErdőS-GyáRfáS Function F ( N, 4, 5 ) = 5 6 N <MML: Mo Linebreak="Goodbreak" …. Journal of Combinatorial Theory Series B (2024)

Patrick BennettRyan CushmanAndrzej DudekPaweł Prałat

molecular biologycombinatorics

The Generalized Ramsey Number $F(N, 5, 8) = \Frac 67 N + O(N)$. arXiv (Cornell University) (2024)

Bennett, PatrickCushman, RyanDudek, Andrzej

combinatorial theorycombinatoricsgroup theoryfinite fieldsabstract complexitynumber theorygeneralized ramsey numberapplied mathematicsmathematics

Twins in Ordered Hyper-Matchings. Discussiones Mathematicae Graph Theory (2024)

Andrzej DudekJaros\l aw GrytczukAndrzej Ruciński

ordered hyper-matchingsgraph theoryhypergraph theoryapplied mathematics

ErdőS-Szekeres Type Theorems for Ordered Uniform Matchings. arXiv (Cornell University) (2023)

1
2
3
4
5
16
10 / page

Similar Faculty Members

Bernard Lidický

Institution

Iowa State University

discrete algorithm

extremal graph theory

Patrick Bennett

Institution

Western Michigan University

discrete algorithm

combinatorics

Theodore Molla

Institution

University of South Florida

discrete algorithm

probabilistic graph theory

Ryan Martin

Institution

Iowa State University

extremal graph theory

extremal poset theory

Dhruv Mubayi

Institution

University of Illinois Chicago

computational problem

probabilistic graph theory

Olivier Bernardi

Institution

Brandeis University

statistical mechanic

probability theory

Lionel Levine

Institution

Cornell University

probability theory

discrete geometry

Richard Ehrenborg

Institution

University of Kentucky

mathematics education

discrete structure

Jason McCullough

Institution

Iowa State University

algebra

commutative algebra

Jacques Verstraete

Institution

University of California, San Diego

discrete algorithm

extremal graph theory

Similar Faculty Members

Bernard Lidický

Institution

Iowa State University

discrete algorithm

extremal graph theory

Patrick Bennett

Institution

Western Michigan University

discrete algorithm

combinatorics

Theodore Molla

Institution

University of South Florida

discrete algorithm

probabilistic graph theory

Ryan Martin

Institution

Iowa State University

extremal graph theory

extremal poset theory

Dhruv Mubayi

Institution

University of Illinois Chicago

computational problem

probabilistic graph theory

Olivier Bernardi

Institution

Brandeis University

statistical mechanic

probability theory

Lionel Levine

Institution

Cornell University

probability theory

discrete geometry

Richard Ehrenborg

Institution

University of Kentucky

mathematics education

discrete structure

Jason McCullough

Institution

Iowa State University

algebra

commutative algebra

Jacques Verstraete

Institution

University of California, San Diego

discrete algorithm

extremal graph theory