Michael E. Picollelli

According to our database, Michael E. Picollelli authored at least 11 papers between 2008 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

4-Chromatic Graphs Have At Least Four Cycles of Length $0 \bmod 3$.

Sean Kim, Michael E. Picollelli

Electron. J. Comb., 2024

2023

4-Chromatic Graphs Have At Least 4 Cycles of Length 0 mod 3.

Sean Kim, Michael E. Picollelli

CoRR, 2023

2015

Complete r-partite Graphs Determined by their Domination Polynomial.

Barbara M. Anthony, Michael E. Picollelli

Graphs Comb., 2015

2014

The Final Size of the C_ℓ-free Process.

Michael E. Picollelli

SIAM J. Discret. Math., 2014

The diamond-free process.

Michael E. Picollelli

Random Struct. Algorithms, 2014

2012

SIR epidemics on random graphs with a fixed degree sequence.

Tom Bohman, Michael E. Picollelli

Random Struct. Algorithms, 2012

Detecting clustering in streams.

Michael E. Picollelli, Charles G. Boncelet Jr., Lisa M. Marvel

Proceedings of the 46th Annual Conference on Information Sciences and Systems, 2012

2011

Set systems without a 3-simplex.

Michael E. Picollelli

Discret. Math., 2011

The Final Size of the <i>C</i>₄-Free Process.

Michael E. Picollelli

Comb. Probab. Comput., 2011

Detecting clustering in binary sequences.

Michael E. Picollelli, Charles G. Boncelet Jr., Lisa M. Marvel

Proceedings of the 45st Annual Conference on Information Sciences and Systems, 2011

2008

An Anti-Ramsey Condition on Trees.

Michael E. Picollelli

Electron. J. Comb., 2008