Robustness of graph properties
From MaRDI portal
Publication:5234225
DOI10.1017/9781108332699.009zbMath1423.05186arXiv1610.00117OpenAlexW2529837827MaRDI QIDQ5234225
Publication date: 25 September 2019
Published in: Surveys in Combinatorics 2017 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.00117
Random graphs (graph-theoretic aspects) (05C80) Graph theory (05C99) Eulerian and Hamiltonian graphs (05C45)
Related Items (15)
Triangle resilience of the square of a Hamilton cycle in random graphs ⋮ On resilience of connectivity in the evolution of random graphs ⋮ Graph Tilings in Incompatibility Systems ⋮ Oriented discrepancy of Hamilton cycles ⋮ Perfect matchings in random subgraphs of regular bipartite graphs ⋮ The global resilience of Hamiltonicity in \(G(n, p)\) ⋮ Color‐biased Hamilton cycles in random graphs ⋮ Covering cycles in sparse graphs ⋮ Turán‐type problems for long cycles in random and pseudo‐random graphs ⋮ Properly colored Hamilton cycles in Dirac-type hypergraphs ⋮ Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers ⋮ Rainbow factors in hypergraphs ⋮ Hamiltonicity in random directed graphs is born resilient ⋮ A discrepancy version of the Hajnal–Szemerédi theorem ⋮ 2-factors with \(k\) cycles in Hamiltonian graphs
This page was built for publication: Robustness of graph properties
