Author of the publication

Max Cuts in Triangle-free Graphs

, , and . (2021)cite arxiv:2103.14179Comment: This is an extended abstract submitted to EUROCOMB 2021. Comments are welcome.

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The diameter game., , and . Random Struct. Algorithms, 35 (3): 369-389 (2009)Triangle factors of graphs without large independent sets and of weighted graphs., , and . Random Struct. Algorithms, 49 (4): 669-693 (2016)Graph bootstrap percolation., , and . Random Struct. Algorithms, 41 (4): 413-440 (2012)Transitive triangle tilings in oriented graphs., , and . J. Comb. Theory, Ser. B, (2017)Almost All C4-Free Graphs Have Fewer than (1-epsilon), ex(n, C4) Edges., and . SIAM J. Discret. Math., 24 (3): 1011-1018 (2010)On Avoider-Enforcer Games., and . SIAM J. Discret. Math., 23 (2): 901-908 (2009)Cubic Graphs with Small Independence Ratio., , and . Electron. J. Comb., 26 (1): 1 (2019)The Ramsey Number of Fano Plane Versus Tight Path., , , and . Electron. J. Comb., 27 (1): 1 (2020)Monochromatic Hilbert Cubes and Arithmetic Progressions., , , and . Electron. J. Comb., 26 (2): 2 (2019)Local resilience of almost spanning trees in random graphs., , and . Random Struct. Algorithms, 38 (1-2): 121-139 (2011)