Almost spanning subgraphs of random graphs after adversarial edge removal (Q2840559): Difference between revisions
From MaRDI portal
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts |
ReferenceBot (talk | contribs) Changed an Item |
||||||||||||||
(2 intermediate revisions by 2 users not shown) | |||||||||||||||
aliases / en / 0 | aliases / en / 0 | ||||||||||||||
Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal | |||||||||||||||
description / en | description / en | ||||||||||||||
scientific article; zbMATH DE number 6261147 | |||||||||||||||
Property / title | |||||||||||||||
Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal (English) | |||||||||||||||
Property / title: Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal (English) / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Open document ID | |||||||||||||||
Property / zbMATH Open document ID: 1282.05194 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / DOI | |||||||||||||||
Property / DOI: 10.1017/S0963548313000199 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / published in | |||||||||||||||
Property / published in: Combinatorics, Probability and Computing / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / publication date | |||||||||||||||
24 February 2014
| |||||||||||||||
Property / publication date: 24 February 2014 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Mathematics Subject Classification ID | |||||||||||||||
Property / Mathematics Subject Classification ID: 05C35 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Mathematics Subject Classification ID | |||||||||||||||
Property / Mathematics Subject Classification ID: 05C60 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH DE Number | |||||||||||||||
Property / zbMATH DE Number: 6261147 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Keywords | |||||||||||||||
almost spanning bipartite graphs | |||||||||||||||
Property / zbMATH Keywords: almost spanning bipartite graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Wikidata QID | |||||||||||||||
Property / Wikidata QID: Q105585014 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Sparse universal graphs for bounded‐degree graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q3579480 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Proof of the bandwidth conjecture of Bollobás and Komlós / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: On the resilience of long cycles in random graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q3579496 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Some Theorems on Abstract Graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Szemerédi’s Regularity Lemma for Sparse Graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q4407452 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Sparse partition universal graphs for graphs of bounded degree / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Local resilience of graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Path and cycle sub-Ramsey numbers and an edge-colouring conjecture / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Polychromatic Hamilton cycles / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Properly coloured copies and rainbow copies of large graphs with small maximum degree / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Corrádi and Hajnal's Theorem for Sparse Random Graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Local resilience of almost spanning trees in random graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Embedding nearly-spanning bounded degree trees / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Hypergraph Packing and Graph Embedding / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Regular pairs in sparse random graphs I / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Bandwidth theorem for random graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Small subsets inherit sparse \(\varepsilon\)-regularity / rank | |||||||||||||||
Normal rank |
Latest revision as of 10:02, 7 July 2024
scientific article; zbMATH DE number 6261147
- Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal
Language | Label | Description | Also known as |
---|---|---|---|
English | Almost spanning subgraphs of random graphs after adversarial edge removal |
scientific article; zbMATH DE number 6261147 |
|
Statements
Almost spanning subgraphs of random graphs after adversarial edge removal (English)
0 references
Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal (English)
0 references
19 July 2013
0 references
24 February 2014
0 references
graph theory
0 references
extremal problems
0 references
random graphs
0 references
sparse regularity
0 references
almost spanning bipartite graphs
0 references