Michael E. Picollelli

12 papers Misc 2Journal 10
YearRankTypeTitle / Venue / Authors
2026 J jnl
On forbidding graphs as traces of hypergraphs.
Discret. Math.
Dániel Gerbner, Michael E. Picollelli
2024 J jnl
4-Chromatic Graphs Have At Least Four Cycles of Length $0 \bmod 3$.
Electron. J. Comb.
Sean Kim, Michael E. Picollelli
2023 J jnl
4-Chromatic Graphs Have At Least 4 Cycles of Length 0 mod 3.
CoRR
Sean Kim, Michael E. Picollelli
2015 J jnl
Complete r-partite Graphs Determined by their Domination Polynomial.
Graphs Comb.
Barbara M. Anthony, Michael E. Picollelli
2014 J jnl
The Final Size of the C
SIAM J. Discret. Math.
Michael E. Picollelli
2014 J jnl
The diamond-free process.
Random Struct. Algorithms
Michael E. Picollelli
2012 Misc conf
Detecting clustering in streams.
CISS
Michael E. Picollelli, Charles G. Boncelet Jr., Lisa M. Marvel
2012 J jnl
SIR epidemics on random graphs with a fixed degree sequence.
Random Struct. Algorithms
Tom Bohman, Michael E. Picollelli
2011 Misc conf
Detecting clustering in binary sequences.
CISS
Michael E. Picollelli, Charles G. Boncelet Jr., Lisa M. Marvel
2011 J jnl
Set systems without a 3-simplex.
Discret. Math.
Michael E. Picollelli
2011 J jnl
The Final Size of the
Comb. Probab. Comput.
Michael E. Picollelli
2008 J jnl
An Anti-Ramsey Condition on Trees.
Electron. J. Comb.
Michael E. Picollelli