Linda Cook, Two results on graphs with holes of restricted lengths
Room B232 IBS (기초과학연구원)We call an induced cycle of length at least four a hole. The parity of a hole is the parity of its length. Forbidding holes of certain types in a graph …
We call an induced cycle of length at least four a hole. The parity of a hole is the parity of its length. Forbidding holes of certain types in a graph …
Twin-width is a new parameter informally measuring how diverse are the neighbourhoods of the graph vertices, and it extends also to other binary relational structures, e.g. to digraphs and posets. It was introduced …
The Weighted
A signed graph is a pair
A particularly important substructure in modeling joint linear chance-constrained programs with random right-hand sides and finite sample space is the intersection of mixing sets with common binary variables (and possibly …
The extremal function
The Alon-Jaeger-Tarsi conjecture states that for any finite field
I am going to present an algorithm for computing a feedback vertex set of a unit disk graph of size k, if it exists, which runs in time $2^{O(\sqrt{k})}(n + …
The Gyárfás-Sumner conjecture says that for every forest
Majority dynamics on a graph