Variance of the Subgraph Count for Sparse Erdős–Rényi Graphs

Discrete Applied Mathematics - Netherlands
doi 10.1016/j.dam.2009.11.012
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Vertex Decompositions of Sparse Graphs Into an Edgeless Subgraph and a Subgraph of Maximum Degree at Most K

Journal of Graph Theory
GeometryTopology
2009English

The Erdős–Hajnal Conjecture for Bull-Free Graphs

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2008English

Subgraph Conditions for Hamiltonian Properties of Graphs

English

An Erdős-Gallai Type Theorem for Vertex Colored Graphs

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2019English

Erdős–Hajnal Conjecture for Graphs With Bounded VC-Dimension

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2018English

Sparse Universal Graphs for Bounded-Degree Graphs

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2007English

PTAS for Densest K-Subgraph in Interval Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

The Social Brain: Scale-Invariant Layering of Erdős–Rényi Networks in Small-Scale Human Societies

Journal of the Royal Society Interface
BiochemistryBiophysicsBiomaterialsBiotechnologyBioengineeringBiomedical Engineering
2016English

Sparse Precision Matrices for Minimum Variance Portfolios

Computational Management Science
Information SystemsManagement Information Systems
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy