Researchain
Decentralized Journals
A
Archives
Welcome to Researchain!
Feedback Center
Decentralized Journals
A
Archives
Updated
Mathematics
Combinatorics
Books in graphs
Bela Bollobas
,
Vladimir Nikiforov
Abstract
A book of size q is a set of q triangles sharing a common edge. We study the size of the maximal book in a graph as a function of the number of its edges. In particular, we answer two questions of Erdos about graphs that are union of triangles.
Full PDF
Related Researches
The "Grothendieck to Lascoux" conjecture
by
Victor Reiner
Quaternary Hermitian self-dual codes of lengths 26, 32, 36, 38 and 40 from modifications of well-known circulant constructions
by
Adam Michael Roberts
Automorphisms of tropical Hassett spaces
by
Sam Freedman
Rainbow spanning trees in random edge-colored graphs
by
Peter Bradshaw
Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree
by
Jianhua Tu
Obstructions for local tournament orientation completions
by
Kevin Hsu
Lower bounds on the Erd?s-Gyárfás problem via color energy graphs
by
József Balogh
On the number of hyperedges in the hypergraph of lines and pseudo-discs
by
Chaya Keller
Fertilitopes
by
Colin Defant
Rotor-routing reachability is easy, chip-firing reachability is hard
by
Lilla Tóthmérész
Magic squares and the symmetric group
by
Ofir Gorodetsky
Lower bounds for corner-free sets
by
Ben Green
A proof of Lee-Lee's conjecture about geometry of rigid modules
by
Son Dang Nguyen
Large expanders in high genus unicellular maps
by
Baptiste Louf
Minimum degree stability of H -free graphs
by
Freddie Illingworth
Mixed graphs with cut vertices having exactly two positive eigenvalues
by
Xiaocong He
On Metric Dimensions of Hypercubes
by
Aleksander Kelenc
A note on [D. G. Higman 1988 : Strongly regular designs and coherent configurations of type [ 3 2 3 ] ]
by
Akihide Hanaki
Inclusion-exclusion on Schubert polynomials
by
Karola Mészáros
A generalisation of uniform matroids
by
George Drummond
Conditionally decomposable polytopes
by
Jie Wang
Triangulations, order polytopes, and generalized snake posets
by
Matias von Bell
Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation
by
Johannes Pardey
On polyhedral graphs and their complements
by
Riccardo Walter Maffucci
Two-distance transitive normal Cayley graphs
by
Jun-Jie Huang
«
1
2
3
4
»
Submitted on 5 May 2004
Updated
arXiv.org
Original Source
NASA ADS
Google Scholar
Semantic Scholar