The block-cutpoint tree characterization of a covering polynomial of a graph Robert Ellis (IIT)

1. The block-cutpoint tree characterization of a covering polynomial of a graph Robert Ellis (IIT) James Ferry, Darren Lo (Metron, Inc.) Dhruv Mubayi (UIC) AMS Fall Central Section Meeting November 6, 2010 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAA

2. Random Intersection Model B*(n,m,p) Introduced: Karoński, Scheinerman, Singer-Cohen `99 Bipartite graph models collaboration Activity nodes Participant nodes Random Intersection Graph B*(n,m,p) Bipartite edges arise independently with constant probability Unipartite projection onto participant nodes m: number of “movies” Bipartite graph n: number of “actors” Unipartite projection Collaboration graph: who’s worked with whom

3. Expected sugbraph count vs. E-R 60-cycle • Erdős–Rényi • n= 1000 • pER= 0.002 • Random Intersection • n= 1000 • m= 100 • p= 0.0045 • Yields pER= 0.002

4. Erdős–Rényi vs. RI Model as m→ ∞ m = “number of movies” pER= 0.028 (edge probability) RC model (m= 1) RC model (m= 10,000) RC model (m= 1000) RC model (m= 100) RC model (m= 10) RC model (m= 2) RI Erdős–Rényi G(n,pER) model B*(N,M,p)

5. Theorem[Ferry, Mifflin]. For a fixed expected number of edges pER , and any graph G with n vertices, the probability of G being generated by the Random Intersection model approaches the probability of G being generated by the Erdős–Rényi model as m→ ∞. Formula for rate of convergence: [(Independently) Fill, Scheinerman, Singer-Cohen `00] With m=nα, α>6, total variation distance for probability of G goes to zero as n → ∞. Erdős–Rényi vs. RI Model as m→ ∞

6. Idea: Let m → ∞ and fix the expected number of movies per actor at constant μ=pm. This allows simplified asymptotic probabilities for random intersection graphs on a fixed number of nodes. Probability formulas are from edge clique covers Most probable graphs have block-complete structure Least probable graphs have connections to Turán-type extremal graphs RI model in the constant-μ limit Slide 6

7. Edge clique covers Unipartite projection corresponds to an edge clique cover The projection-induced cover encodes collaboration structure Hidden collaboration perspective: Given B*(n,m,p)=G, we can infer which clique covers are most likely This reveals the most likely hidden collaboration structure that produced G Unipartite projection

8. Covering polynomial of G “size” of clique cover S “weight” of S,G ai = #least-wt covers of size i Projection wt=5 (not least-weight) wt=4, s=7 (2 ways) wt=4, s=6 Thus wt(G) = 4 and s(G; x) = x6 + 2x7. Slide 8

9. Theorem [Lo]. Let n be fixed and let G be a fixed graph on n vertices. In the constant-m limit, Lower weight graphs are more likely If G has a lower weight supergraph H, G is more likely to appear as a subgraph of H than as an induced graph Theorem. Let n be fixed and let G be a fixed graph on n non-isolated vertices with j cut-vertices. In the constant-m limit,where the bi are block degrees of the cut-vertices of G, and is the bth Touchard polynomial. Fixed graphs in the constant-μ limit

10. Let H be Stirling numbers count partitionsof bi blocks into s “movies” Example subgraph probability rank(H) = 7 n(H)=8 2 cut-vertices; 4 blocks b1= 3 b2= 2 Block-cutpointtree of H Slide 10

11. Block-cutpoint tree → Least-weight supergraphs Select an unvisited cut-vertex. Partition incident blocks, merge, and make block-complete. Update block-cutpoint tree. Repeat 1 until all original cut-vertices are visited.

12. An extremal graph weight conjecture • Conjecture [Lo]. Let G have n vertices. Then • with equality iff there exists a bipartition V(G)=such that: • A= • B= • The complete (A,B)-bipartite graph is a subgraph of G • Either A or B is an independent set. Slide 12

13. Related simpler questions Conjecture. Every K4-free graph G on n vertices and edges has at least m edge-disjoint K3’s. Theorem [Győri]. True for G with chromatic number at most 3. Theorem. True when G is K4-free and where k≤n2/84+O(1). Slide 13