Results 41 to 50 of about 1,639 (93)

Packing spanning graphs from separable families

open access: yes, 2016
Let $\mathcal G$ be a separable family of graphs. Then for all positive constants $\epsilon$ and $\Delta$ and for every sufficiently large integer $n$, every sequence $G_1,\dotsc,G_t\in\mathcal G$ of graphs of order $n$ and maximum degree at most $\Delta$
Ferber, Asaf   +2 more
core   +1 more source

A sharp threshold for random graphs with a monochromatic triangle in every edge coloring

open access: yes, 2003
Let $\R$ be the set of all finite graphs $G$ with the Ramsey property that every coloring of the edges of $G$ by two colors yields a monochromatic triangle. In this paper we establish a sharp threshold for random graphs with this property.
Friedgut, Ehud   +3 more
core   +3 more sources

Efficient parallelization of tensor network contraction for simulating quantum computation. [PDF]

open access: yesNat Comput Sci, 2021
Huang C   +20 more
europepmc   +1 more source

Tournaments, 4-uniform hypergraphs, and an exact extremal result

open access: yes, 2016
We consider $4$-uniform hypergraphs with the maximum number of hyperedges subject to the condition that every set of $5$ vertices spans either $0$ or exactly $2$ hyperedges and give a construction, using quadratic residues, for an infinite family of such
Gunderson, Karen, Semeraro, Jason
core  

Embedding large subgraphs into dense graphs

open access: yes, 2009
What conditions ensure that a graph G contains some given spanning subgraph H? The most famous examples of results of this kind are probably Dirac's theorem on Hamilton cycles and Tutte's theorem on perfect matchings. Perfect matchings are generalized by
Kühn, Daniela, Osthus, Deryk
core   +1 more source

Monotone Circuit Lower Bounds from Robust Sunflowers. [PDF]

open access: yesAlgorithmica, 2022
Cavalar BP, Kumar M, Rossman B.
europepmc   +1 more source

Home - About - Disclaimer - Privacy