On lower bounds for the matching number of subcubic graphs

We give a complete description of the set of triples (α, β, γ) of real numbers with the following property. There exists a constant K such that αn3 + βn2 + γn...

Popoln opis

Bibliografske podrobnosti
Main Authors:	Haxell, P, Scott, A
Format:	Journal article
Izdano:	Wiley 2016

Podobne knjige/članki

Star Coloring of Subcubic Graphs
od: Karthick T., et al.
Izdano: (2013-05-01)

Interval Incidence Coloring of Subcubic Graphs
od: Małafiejska Anna, et al.
Izdano: (2017-05-01)

On locally irregular decompositions of subcubic graphs
od: Olivier Baudon, et al.
Izdano: (2018-01-01)

List Star Edge-Coloring of Subcubic Graphs
od: Kerdjoudj Samia, et al.
Izdano: (2018-11-01)

Total Colouring of New Classes of Subcubic graphs
od: Sethuraman G, et al.
Izdano: (2022-07-01)

Packing Three-Vertex Paths in a Subcubic Graph
od: Adrian Kosowski, et al.
Izdano: (2005-01-01)

Hereditary Equality of Domination and Exponential Domination in Subcubic Graphs
od: Chen Xue-Gang, et al.
Izdano: (2021-11-01)

Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter
od: Abboud, Amir, et al.
Izdano: (2022)

The tree-achieving set and non-separating independent set problem of subcubic graphs
od: Fayun Cao, et al.
Izdano: (2025-01-01)

A New Proof for a Result on the Inclusion Chromatic Index of Subcubic Graphs
od: Lily Chen, et al.
Izdano: (2022-01-01)

A bound on the number of perfect matchings in Klee-graphs
od: Marek Cygan, et al.
Izdano: (2013-01-01)

Subcubic Min-Plus Product of Structured Matrices
od: Xu, Yinzhan
Izdano: (2022)

Beyond the low-degree algorithm: mixtures of subcubes and their applications
od: Chen, Sitan, et al.
Izdano: (2022)

Subcubic equivalences between path, matrix, and triangle problems
od: Williams, VV, et al.
Izdano: (2021)

Beyond the low-degree algorithm: mixtures of subcubes and their applications
od: Chen, Sitan, et al.
Izdano: (2021)

Finding the Best 3-OPT Move in Subcubic Time
od: Giuseppe Lancia, et al.
Izdano: (2020-11-01)

Improved lower bounds on book crossing numbers of complete graphs
od: Salazar, G., et al.
Izdano: (2014)

Improved lower bounds for book crossing numbers of complete graphs
od: de Klerk, E, et al.
Izdano: (2013)

Lower Bound on the Number of Hamiltonian Cycles of Generalized Petersen Graphs
od: Lu Weihua, et al.
Izdano: (2020-02-01)

Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product
od: Bringmann, Karl, et al.
Izdano: (2021)

An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs
od: Shibsankar Das
Izdano: (2020-08-01)

Truly subcubic min-plus product for less structured matrices, with applications
od: Williams, VV, et al.
Izdano: (2021)

A General Lower Bound on Gallai-Ramsey Numbers for Non-Bipartite Graphs
od: Colton Magnant
Izdano: (2018-01-01)

Lower bounds for the energy of graphs
od: Akbar Jahanbani
Izdano: (2018-04-01)

A note on intersecting hypergraphs with large cover number
od: Haxell, P, et al.
Izdano: (2017)

A Note on Cycle Lengths in Graphs
od: Gould, R, et al.
Izdano: (2002)

Note: Sharp Upper and Lower Bounds on the Number of Spanning Trees in Cartesian Product of Graphs
od: Azarija Jernej
Izdano: (2013-09-01)

A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$
od: Christina Mynhardt, et al.
Izdano: (2019-09-01)

The matching number and Hamiltonicity of graphs
od: Rao Li
Izdano: (2020-09-01)

On Selkow’s Bound on the Independence Number of Graphs
od: Harant Jochen, et al.
Izdano: (2019-08-01)

Bounds for the pebbling number of product graphs
od: Nopparat Pleanmani, et al.
Izdano: (2022-12-01)

On lower bounds for the metric dimension of graphs
od: Mohsen Jannesari
Izdano: (2023-01-01)

An upper bound for the chromatic number of line graphs
od: Andrew D. King, et al.
Izdano: (2005-01-01)

The lower bound for number of hexagons in strongly regular graphs with parameters $\lambda=1$ and $\mu=2$
od: Reimbay Reimbayev
Izdano: (2024-08-01)

Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes
od: Katona Gyula Y., et al.
Izdano: (2014-11-01)

Independence number in graphs and its upper bounds
od: Farzad Shaveisi
Izdano: (2025-01-01)

An improved bound on the chromatic number of the Pancake graphs
od: Leen Droogendijk, et al.
Izdano: (2024-01-01)

Bounds on the Signed 2-Independence Number in Graphs
od: Volkmann Lutz
Izdano: (2013-09-01)

Bounds on the 2-domination number in cactus graphs
od: Mustapha Chellali
Izdano: (2006-01-01)

Upper bounds on the bondage number of a graph
od: Vladimir Dimitrov Samodivkin
Izdano: (2018-04-01)