Balance in random signed intersection graphs
From MaRDI portal
Publication:5206908
zbMATH Open1429.05189MaRDI QIDQ5206908FDOQ5206908
Authors: Christoforos L. Raptopoulos, Konstantinos Papalamprou Error creating thumbnail:
Publication date: 19 December 2019
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/75/ajc_v75_p050.pdf
Recommendations
Cites Work
- On Random Intersection Graphs: The Subgraph Problem
- A mathematical bibliography of signed and gain graphs and allied areas
- On the notion of balance of a signed graph
- The probabilistic method
- On the asymptotic proportion of connected matroids
- On the number of matroids
- Large independent sets in general random intersection graphs
- On the number of matroids compared to the number of sparse paving matroids
- Decompositions of signed-graphic matroids
- Balance in random signed graphs
- Weak Balance in Random Signed Graphs
Cited In (3)
This page was built for publication: Balance in random signed intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5206908)