1 citations · 1 across the 1 of their papers we have counts for
8 papers
On the asymptotic confirmation of the Faudree-Lehel Conjecture for general graphs
Jakub Przybyło, Fan Wei
Given a simple graph , the {\it irregularity strength} of , denoted by , is the least positive integer such that there is a weight assignment on edges $f: E(G) \to…
Short proof of the asymptotic confirmation of the Faudree-Lehel Conjecture
Jakub Przybyło, Fan Wei
Given a simple graph , the {\it irregularity strength} of , denoted , is the least positive integer such that there is a weight assignment on edges $f: E(G) \to \{1…
Threshold Ramsey multiplicity for odd cycles
David Conlon, Jacob Fox, Benny Sudakov +1
The Ramsey number of a graph is the minimum such that any two-coloring of the edges of the complete graph contains a monochromatic copy of . The threshold R…
Irregular Subgraphs
Noga Alon, Fan Wei
We suggest two related conjectures dealing with the existence of spanning irregular subgraphs of graphs. The first asserts that any -regular graph on vertices contains a spa…
On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices
Jacob Fox, Lisa Sauermann, Fan Wei
Given a -vertex graph and an integer , what are the -vertex graphs with the maximum number of induced copies of ? This question is closely related to the inducibili…
Finding Cliques in Social Networks: A New Distribution-Free Model
Jacob Fox, Tim Roughgarden, C. Seshadhri +2
We propose a new distribution-free model of social networks. Our definitions are motivated by one of the most universal signatures of social networks, triadic closure---the propert…