default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Borg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j46]Peter Borg
, Carl Feghali, Rémi Pellerin:
Solution to a problem of Katona on counting cliques of weighted graphs. Discret. Appl. Math. 345: 147-155 (2024)- [j45]Karl Bartolo, Peter Borg, Dayle Scicluna:
Isolation of squares in graphs. Discret. Math. 347(12): 114161 (2024) - [i9]Peter Borg:
Proof of a conjecture on isolation of graphs dominated by a vertex. CoRR abs/2407.18126 (2024) - 2023
- [j44]Peter Borg:
Isolation of connected graphs. Discret. Appl. Math. 339: 154-165 (2023) - [j43]Peter Borg, Carl Feghali:
The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem. Discuss. Math. Graph Theory 43(1): 277-286 (2023) - [i8]Peter Borg:
Isolation of regular graphs and k-chromatic graphs. CoRR abs/2303.13709 (2023) - [i7]Peter Borg:
Isolation of regular graphs and k-chromatic graphs. CoRR abs/2304.10659 (2023) - [i6]Karl Bartolo, Peter Borg, Dayle Scicluna:
Isolation of squares in graphs. CoRR abs/2310.09128 (2023) - 2022
- [j42]Peter Borg, Kurt Fenech, Pawaton Kaemawichanurat:
Isolation of k-cliques II. Discret. Math. 345(7): 112641 (2022) - [j41]Peter Borg, Carl Feghali:
The maximum sum of sizes of cross-intersecting families of subsets of a set. Discret. Math. 345(11): 112981 (2022) - [j40]Peter Borg:
Decreasing the maximum degree of a graph. Discret. Math. 345(11): 112994 (2022) - [j39]Peter Borg, Carl Feghali:
A short proof of Talbot's theorem for intersecting separated sets. Eur. J. Comb. 101: 103471 (2022) - [i5]Peter Borg, Carl Feghali, Rémi Pellerin:
Solution to a problem of Katona on counting cliques of weighted graphs. CoRR abs/2211.04153 (2022) - 2021
- [i4]Peter Borg:
Isolation of connected graphs. CoRR abs/2110.03773 (2021) - 2020
- [j38]Peter Borg, Kurt Fenech:
A Turán-type generalization of Tuza's triangle edge cover problem. Australas. J Comb. 78: 399-412 (2020) - [j37]Peter Borg, Pawaton Kaemawichanurat:
Partial domination of maximal outerplanar graphs. Discret. Appl. Math. 283: 306-314 (2020) - [j36]Peter Borg, Kurt Fenech, Pawaton Kaemawichanurat:
Isolation of k-cliques. Discret. Math. 343(7): 111879 (2020) - [j35]Peter Borg:
Cross-intersecting subfamilies of levels of hereditary families. Discret. Math. 343(8): 111900 (2020) - [j34]Peter Borg:
Isolation of Cycles. Graphs Comb. 36(3): 631-637 (2020) - [i3]Peter Borg:
Reducing the maximum degree of a graph: comparisons of bounds. CoRR abs/2007.08930 (2020) - [i2]Peter Borg, Carl Feghali:
The maximum sum of sizes of cross-intersecting families of subsets of a set. CoRR abs/2012.15356 (2020)
2010 – 2019
- 2019
- [j33]Peter Borg, Kurt Fenech:
Reducing the maximum degree of a graph by deleting edges. Australas. J Comb. 73: 247-260 (2019) - [j32]Irene Sciriha, Josef Lauri, John Baptist Gauci, Peter Borg:
Preface: The Second Malta Conference in Graph Theory and Combinatorics. Discret. Appl. Math. 266: 1-2 (2019) - [j31]Peter Borg, Yair Caro, Kurt Fenech:
Irregular independence and irregular domination. Discret. Appl. Math. 266: 76-84 (2019) - [j30]Peter Borg:
Cross-intersecting non-empty uniform subfamilies of hereditary families. Eur. J. Comb. 78: 256-267 (2019) - 2018
- [j29]Peter Borg:
Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas. Discret. Math. 341(5): 1331-1335 (2018) - [i1]Peter Borg, Kurt Fenech, Pawaton Kaemawichanurat:
Isolation of k-cliques. CoRR abs/1812.11098 (2018) - 2017
- [j28]Peter Borg, Kurt Fenech:
Reducing the maximum degree of a graph by deleting vertices. Australas. J Comb. 69: 29-40 (2017) - [j27]Peter Borg:
Stars on trees. Discret. Math. 340(5): 1046-1049 (2017) - [j26]Peter Borg:
The maximum product of sizes of cross-intersecting families. Discret. Math. 340(9): 2307-2317 (2017) - 2016
- [j25]Peter Borg:
Intersecting integer partitions. Australas. J Comb. 66: 265-275 (2016) - [j24]Peter Borg:
A Sharp Bound for the Product of Weights of Cross-Intersecting Families. Electron. J. Comb. 23(4): 4 (2016) - [j23]Peter Borg:
The maximum product of weights of cross-intersecting families. J. Lond. Math. Soc. 94(3): 993-1018 (2016) - 2015
- [j22]Peter Borg, Karen Meagher:
Intersecting generalised permutations. Australas. J Comb. 61: 147-155 (2015) - 2014
- [j21]Peter Borg:
Erdős-Ko-Rado with separation conditions. Australas. J Comb. 59: 39-63 (2014) - [j20]Peter Borg:
The maximum product of sizes of cross-t-intersecting uniform families. Australas. J Comb. 60: 69-78 (2014) - [j19]Peter Borg:
A short proof of an Erdős-Ko-Rado theorem for compositions. Discret. Math. 333: 62-65 (2014) - [j18]Peter Borg:
Strongly intersecting integer partitions. Discret. Math. 336: 80-84 (2014) - [j17]Peter Borg:
The maximum sum and the maximum product of sizes of cross-intersecting families. Eur. J. Comb. 35: 117-130 (2014) - 2013
- [j16]Peter Borg:
Non-trivial intersecting uniform sub-families of hereditary families. Discret. Math. 313(17): 1754-1761 (2013) - [j15]Peter Borg:
A Hilton-Milner-type theorem and an intersection conjecture for signed sets. Discret. Math. 313(18): 1805-1815 (2013) - 2012
- [j14]Peter Borg:
Cross-intersecting sub-families of hereditary families. J. Comb. Theory A 119(4): 871-881 (2012) - 2011
- [j13]Peter Borg:
On Chvátal's conjecture and a conjecture on families of signed sets. Eur. J. Comb. 32(1): 140-145 (2011) - [j12]Peter Borg:
The maximum sum and product of sizes of cross-intersecting families. Electron. Notes Discret. Math. 38: 167-172 (2011) - [j11]Peter Borg:
Maximum Hitting of a Set by Compressed Intersecting Families. Graphs Comb. 27(6): 785-797 (2011) - 2010
- [j10]Peter Borg:
On Cross-Intersecting Uniform Sub-Families of Hereditary Families. Electron. J. Comb. 17(1) (2010) - [j9]Peter Borg:
Cross-intersecting families of permutations. J. Comb. Theory A 117(4): 483-487 (2010) - [j8]Peter Borg, Imre Leader:
Multiple cross-intersecting families of signed sets. J. Comb. Theory A 117(5): 583-588 (2010) - [j7]Peter Borg:
Cross-Intersecting Families of Partial Permutations. SIAM J. Discret. Math. 24(2): 600-608 (2010)
2000 – 2009
- 2009
- [j6]Peter Borg, Fred C. Holroyd:
The Erdos-Ko-Rado properties of various graphs containing singletons. Discret. Math. 309(9): 2877-2885 (2009) - [j5]Peter Borg:
On t-intersecting families of signed sets and permutations. Discret. Math. 309(10): 3310-3317 (2009) - [j4]Peter Borg:
A short proof of a cross-intersection theorem of Hilton. Discret. Math. 309(14): 4750-4753 (2009) - [j3]Peter Borg, Fred C. Holroyd:
The Erdos-Ko-Rado properties of set systems defined by double partitions. Discret. Math. 309(14): 4754-4761 (2009) - 2008
- [j2]Peter Borg:
Intersecting and Cross-Intersecting Families of Labeled Sets. Electron. J. Comb. 15(1) (2008) - 2007
- [j1]Peter Borg:
Intersecting Systems of Signed Sets. Electron. J. Comb. 14(1) (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
