203 citations · 470 across the 96 of their papers we have counts for
6 papers · 1 filter
Disjoint induced subgraphs of the same order and size
Béla Bollobás, Teeradej Kittipassorn, Bhargav Narayanan +1
For a graph , let be the largest integer for which there exist two vertex-disjoint induced subgraphs of each on vertices, both inducing the same number of edg…
Excluding induced subdivisions of the bull and related graphs
Maria Chudnovsky, Irena Penev, Alexander Scott +1
For any graph , let be the class of graphs with no induced subdivision of . It was conjectured in [A.D. Scott, Induced trees in graphs of large chromatic nu…
Hypergraphs of bounded disjointness
Alex Scott, Elizabeth Wilmer
A -uniform hypergraph is -almost intersecting if every edge is disjoint from exactly other edges. Gerbner, Lemons, Palmer, Patkós and Szécsi conjectured that for every $k…
Substitution and -Boundedness
Maria Chudnovsky, Irena Penev, Alex Scott +1
A class of graphs is said to be {\em -bounded} if there is a function such that for all and all induced s…
Excluding Pairs of Graphs
Maria Chudnovsky, Alex Scott, Paul Seymour
For a graph and a set of graphs , we say that is {\em -free} if no induced subgraph of is isomorphic to a member of . Given an in…
Complete monotonicity for inverse powers of some combinatorially defined polynomials
Alexander D. Scott, Alan D. Sokal
We prove the complete monotonicity on for suitable inverse powers of the spanning-tree polynomials of graphs and, more generally, of the basis generating polynomials…