Andrzej Czygrinow

About

Andrzej Czygrinow works in the area of extremal graph theory and studies extremal graphs which satisfy certain properties. In particular, he works on problems of finding conditions for the minimum degree of a graph that guarantee the existence of certain subgraphs. He is also interested in algorithmic aspects of graph theory, specifically in the theory of distributed algorithms and how the local structure of a network impacts its global properties. His educational background includes a Ph.D. from Emory University in 1998. He is actively involved in teaching various courses related to graph theory, advanced calculus, and mathematical structures at Arizona State University. Additionally, he participates in several university committees and serves as a senator, contributing to the academic community and governance.

Research topics

• Mathematics
• Combinatorics
• Physics
• Discrete mathematics
• Optics

Selected publications

• An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs

  Combinatorics Probability Computing · 2014-10-28 · 22 citations

  articleOpen access1st authorCorresponding

  Hajnal and Szemerédi proved that every graph G with | G | = ks and δ( G )⩾ k ( s − 1) contains k disjoint s -cliques; moreover this degree bound is optimal. We extend their theorem to directed graphs by showing that every directed graph $\vv G$ with | $\vv G$ | = ks and δ( $\vv G$ ) ⩾ 2 k ( s − 1) − 1 contains k disjoint transitive tournaments on s vertices, where δ( $\vv G$ )= min v ∈ V ( $\vv G$ ) d − ( v )+ d + ( v ). Our result implies the Hajnal–Szemerédi theorem, and its degree bound is op…

  PublisherOA PDFDOI

• On odd rainbow cycles in edge-colored graphs

  European Journal of Combinatorics · 2021 · 10 citations

  1st authorCorresponding
  PublisherOA PDFDOI

• Tight Co‐Degree Condition for Packing of Loose Cycles in 3‐Graphs

  Journal of Graph Theory · 2015-10-27 · 10 citations

  article1st authorCorresponding

  Abstract We show that for every even integer there is n 0 such that, if H is a 3‐uniform hypergraph on , vertices such that the minimum co‐degree of H is at least , then H can be tiled with copies of a loose cycle on s vertices. The co‐degree condition is tight.

  PublisherDOI

• Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs

  Lecture notes in computer science · 2014-01-01 · 8 citations

  book-chapter1st authorCorresponding
  PublisherDOI

• Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs

  Theoretical Computer Science · 2016-12-22 · 7 citations

  article1st author
  PublisherDOI

Frequent coauthors

• Michał Hańćkowiak

  Adam Mickiewicz University in Poznań

  29 shared

• Theodore Molla

  18 shared

• Glenn Hurlbert

  17 shared

• Louis DeBiasio

  14 shared

• Wojciech Wawrzyniak

  Adam Mickiewicz University in Poznań

  12 shared

• Brendan Nagle

  12 shared

• H. A. Kierstead

  12 shared

• Marcin Witkowski

  Adam Mickiewicz University in Poznań

  10 shared

Education

• Ph.D.

  Emory University

  1998

Similar researchers at Arizona State University

• Zdzislaw Jackiewiczh-33
• Sharon Crookh-23